Question

4. [30 pts; 10+9+11] a) You are given traffic data (number of p large number, in the order of hundreds of thousands.) with greatest amount of traffic (k is much smaller than n). Which of insertion sort, m quicksort, or heapsort may be used to devise the fastest (in worst case) algorithm for this task? What would be its worst case big O running time, in terms of n and k? (Note: it as soon as you get the top k. And you can use the running times of all involved known entities age hits) for n websites for some time period. (n is a You are asked to print the top k websites ergesort, You cannot modify the steps in any of these known sorting algorithms, but you can stop without derivation.)

Answer 1

4) heap sort will be best for this solution.

and complexity is O(k logn)

because logn for each website and we need k websites.