Page 1 of 1
Which of the following is true about finding kth smallest element in an unsorted array? The best running time in finding
Posted: Fri Jul 01, 2022 5:47 am
by answerhappygod
- Which Of The Following Is True About Finding Kth Smallest Element In An Unsorted Array The Best Running Time In Finding 1 (14.47 KiB) Viewed 29 times
Which of the following is true about finding kth smallest element in an unsorted array? The best running time in finding kth smallest is O(log(n)) as we can use the recursion The best running time in finding kth smallest is O(n) O First, we can sort it and then find the kth position. That will take O(nlog(n)) time in the best case O The best running time in finding kth smallest is O(1) as we find only the kth smallest