Question: Write pseudocode for an O(n) algorithm in this problem. Input: An array A with n distinct numbers(unsorted), an integer k between 1 and n Output:
Write pseudocode for an O(n) algorithm in this problem.
Input: An array A with n distinct numbers(unsorted), an integer k between 1 and n
Output: An array B with the k largest elements in A
(Hint: Select (A, k) returns the kth largest element in the array in O(n) time.)
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
