algorithms.tutorialhorizon.com

Given an array of integers, write an algorithm to find the third smallest element in the array. | Algorithms

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