1. Engineering
  2. Computer Science
  3. lets say we want to get k smallest elements in...

Question: lets say we want to get k smallest elements in...

Question details

Let's say we want to get k smallest elements in an unordered n-element array (where k can be any number in the range of 1 to n).

If these k elements do not have to be in an order, can this task be solved in (n) time? Explain.

Solution by an expert tutor
Blurred Solution
This question has been solved
Subscribe to see this solution