Question: Given n elements and an integer k. Design an algorithm to output a sorted sequence of smallest k elements with time complexity O(n) when klog(n)
Given n elements and an integer k. Design an algorithm to output a sorted sequence of smallest k elements with time complexity O(n) when klog(n) n. Can you solve the same problem for general k with time complexity O(klog(k) + n)? (hint: klog(n) klog(k) + n)
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
