Question: 6. Develop an algorithm of O(nlogk) complexity (with proper analysis) using a heap of k elements to find the largest k numbers in a large,

6. Develop an algorithm of O(nlogk) complexity (with proper analysis) using a heap of k elements to find the largest k numbers in a large, unsorted file of n numbers. Note: You are not supposed to make a heap of n elements. [10 Marks]
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
