engineering recuitment NIC NIELIT Scientist B 2023 Mock Test Algorithms Asymptotic Worst Case Time and Time Complexity Introduction
Given an array of n elements, you have to design an algorithm to find kth smallest elements in sorted order. The Time complexity of the best such algorithm is?
1
O(Klogn)
2
O(n + Klogk)
3
θ (n2)
4
θ (nlogk)