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.

given the lack of choices, i'm gonna wing it and say that pushing your car off a cliff might not be the best idea. your car might sustain damage from the fall and will probably result in the car being too damaged to jump start.

if that's not good enough, avoid filling the car with bees. bees might get agitated when trapped or during the moving process, and might result in death or painful stings that will make jump starting your car very difficult. but in the event that you do choose to fill your car with bees, remember to wear protective gear!