The essential part of heap sort is construction of

109. The essential part of Heap sort is construction of max-heap.
Consider the tree shown below, the node 24 violates the max-heap
property. Once heapify procedure is applied to it, which position will
it be in?
a) 4
b) 5
c) 8
d) 9
110. The descending heap property is ___________ 111. What is its wort case time complexity of Heap sort?

c) O(n2)
d) O(n3)
112. In average case Heap sort is as efficient as the Quick sort.
113. Choose the correct option to fill? X so that the code given below
implements the Heap sort.
#include < stdio. h >
void heapify ( int arr [] , int n, int i )
{
int largest = i ; // Initialize largest as root
int l = 2 * i + 1 ; // left = 2*i + 1
int r = 2 * i + 2 ; // right = 2*i + 2
if ( l < n && arr [ l ] > arr [ largest ])
largest = l ;
if ( r < n && arr [ r ] > arr [ largest ])
largest = r ;
if ( largest != i )
{
swap ( arr [ i ] , arr [ largest ]) ;
heapify ( arr, n, largest ) ;
}
}
void heapSort ( int arr [] , int n )
{
for ( int i = n / 2 - 1 ; i >= 0 ; i -- )
heapify ( arr, n, i ) ;
for ( int i = n - 1 ; i >= 0 ; i -- )
{
X ;
heapify ( arr, i, 0 ) ;
}
}
void printArray ( int arr [] , int n )
{
for ( int i = 0 ; i < n ; ++ i )
printf ( “ % d”,arr [ i ]) ;
printf ( “\n” ) ;
}
int main ()
{
int arr [] = { 12 , 11 , 13 , 5 , 6 , 7 } ;
int n = sizeof ( arr ) / sizeof ( arr [ 0 ]) ;
heapSort ( arr, n ) ;
printf ( “Sorted array is \n ");
printArray(arr, n);
}
a) swap(arr[0], arr[n])
b) swap(arr[i], arr[n])

c) swap(arr[0], arr[i])
d) swap(arr[i], arr[2*i])
114. Which one of the following is a variation of Heap sort?
a) Comb sort
b) Smooth sort
c) Binary tree sort
d) Shell sort
115. Introsort algorithm is combination of _____________
116. How many elements can be sorted in O(logn) time using Heap
sort?
117. Master’s theorem is used for? 118. How many cases are there under Master’s theorem?
a) 2
b) 3