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?

State True or False for internal sorting algorithms.

(i) Internal sorting are applied when the entire collection if data to be sorted is small enough that the sorting can take place within main memory.
(ii) The time required to read or write is considered to be significant in evaluating the performance of internal sorting.

………. is putting an element in the appropriate place in a sorted list yields a larger sorted order list.

Which of the following sorting algorithm is of priority queue sorting type?

If the number of records to be sorted is small, then …… sorting can be efficient.

Consider a situation where swap operation is very costly. Which of the following sorting algorithms should be preferred so that the number of swap operations are minimized in general?

Which of the following is not a stable sorting algorithm in its typical implementation?

The complexity of Bubble sort algorithm is

List obtained in third pass of selection sort for list 3, 5, 4, 1, 2 is ___________

__________ Comparisons required to sort the list 1, 2, 3…….n using insertion sort.

Let P be a Quick Sort Program to sort numbers in ascending order using the first element as pivot. Let t1 and t2 be the number of comparisons made by P for the inputs {1, 2, 3, 4, 5} and {4, 1, 5, 3, 2}

Respectively. Which one of the following holds?

Which of the following is not true about comparison based sorting algorithms?

An unordered list contains n distinct elements. The number of comparisons to find an element in this list that is neither maximum nor minimum is

What is the best case for linear search?

The average number of key comparisons done in a successful sequential search in a list of length n is