case upper bound in terms of k and n on the time to delete the minimum element from the heap, and restore the heap?2) Describe IN ENGLISH an algorithm to print out all elements of the heap wich are less than a given value N. If there are m such elements, what is the complexity of your algorithm?3) Illustrate the operation of stable Counting - Sort on the array A = { 4, 5, 2, 0, 5, 3, 4, 6, 4, 3, 2} Thanks
1) What is a good worst - case upper bound in terms of k and n on the time to delete the minimum element from the heap, and restore the heap? 2) Describe IN ENGLISH an algorithm to print out all elements of the heap wich are less than a given value N. If there are m such elements, what is the complexity of your algorithm? 3) Illustrate the operation of stable Counting - Sort on the array A = { 4, 5, 2, 0, 5, 3, 4, 6, 4, 3, 2} Thanks 1) Consider k – ary heaps of n elements where each k-node has k children : a) What is a good worst - case upper bound in terms of k and n on the time to delete the minimum element from the heap, and restore the heap? b) Describe IN ENGLISH an algorithm to print out all elements of the heap which are less than a given value N. If there are m such elements, what is the complexity of your algorithm? 2) Illustrate the operation of stable Counting - Sort on the array A = { 4, 5, 2, 0, 5, 3, 4, 6, 4, 3, 2} Thanks