This post is completed by 1 user

Add to List 
Find Third Smallest elements in a given array
Objective: Given an array of integers, write an algorithm to find the third smallest element in the array.
Example:
Int [] a = { 6, 8, 1, 9, 2, 10}; Output: Third smallest element is: 6 Int [] a = { 6, 8, 1, 9, 2, 1, 10, 10}; Output: Third smallest element is: 2 Int [] a = {6}; Output: Invalid Input, array size is less than 3
Approach:
 Take three variables; let's call them first, second and third and mark them as +∞.
 Iterate through the array and for each element (let's call it current),
 Check if first>current, assign the first value to the second and second value to third and assign current to first.
 If the above step is not true then the current element might be a candidate of the second smallest element, so check if current<second, if yes then assign second value to third and assign current to second.
 If the above step is not true then the current element might be a candidate of the thirdsmallest element, so check if current<third, if yes then assign current to third.
 At the end print the third, it will thirdsmallest element in the array
See the code below for more understanding.
Code:
Output:
Third smallest element is: 6
Also Read: