Question 1
Suppose we are sorting an array of eight integers using heapsort, and we have just finished some heapify (either maxheapify or minheapify) operations. The array now looks like this: 16 14 15 10 12 27 28 How many heapify operations have been performed on root of heap?
Question 2
Question 3
Which of the following sorting algorithms in its typical implementation gives best performance when applied on an array which is sorted or almost sorted (maximum 1 or two elements are misplaced).
Question 4
(A) [Tex]\\Theta(1)[/Tex] (B) [Tex]\\Theta(\\sqrt{logn})[/Tex] (C) [Tex]\\Theta(Log n/(Log Log n))[/Tex] (d) [Tex]\\Theta(Log n)[/Tex]
Question 5
Given an unsorted array. The array has this property that every element in the array is at most k distance from its position in a sorted array where k is a positive integer smaller than the size of an array. Which sorting algorithm can be easily modified for sorting this array and what is the obtainable time complexity?
Question 6
Question 7
There are 9 questions to complete.