how to find kth smallest and largest element in an array by using Selection sort
Answers
Answered by
0
Explanation:
A simple solution is to sort the given array using a O(N log N) sorting algorithm like Merge Sort, Heap Sort, etc, and return the element at index k-1 in the sorted array.
Similar questions