Teaching UGC NET Mock Test Series 2025 (Paper 1 & 2) Algorithms Searching, Sorting and Hashing Sorting
In Quicksort for n elements array, If partition algorithm always gives 10th smallest element? what is time complexity in that case for quicksort?
1
O(n3)
2
O(logn)
3
O(n2)
4
O(n)