What is the procedure to arrange an integer array in ascending order and find the third highest number?

Question

Accepted Answer

To sort an integer array and find the third highest number, use sorting algorithms and indexing techniques.

Sorting the Array: Use algorithms like QuickSort or MergeSort to arrange the array in ascending order. Example: [5, 2, 9, 1] becomes [1, 2, 5, 9].
Finding the Third Highest: After sorting, access the third last element. Example: In [1, 2, 5, 9], the third highest is 2.
Handling Duplicates: Ensure unique values if necessary. Example: In [3, 3, 2, 1], the unique sorted array is [1, 2, 3], and the third highest is 1.
Edge Cases: Consider arrays with fewer than three unique elements. Example: In [1, 1, 1], there is no third highest.

Interview Questions Asked to Senior Software Engineer Testing at Other Companies