You are given an array A containing n real numbers. For any k < n, describe an algorithm that returns the largest k elements of A in O(n log k) time. You just need to provide the main steps of your algorithm and running time of each steps. For example, your algorithm for this problem could be T opK(A, k) that take the array A and integer k as input and returns the largest k elements of A : T opK(A, k) a. Sort A in decreasing order.
b. Return the first k elements of A.