Question 51
Which of the following is not true about comparison-based sorting algorithms?
Question 52
Question 54
If we use Radix Sort to sort n integers in the range (nk/2,nk], for some k>0 which is independent of n, the time taken would be?
Question 55
Quick sort is run on 2 inputs shown below to sort in ascending order
A. 1, 2, 3……n B. n, n – 1, n – 2 …… 1
Let C1 and C2 be the number of comparisons made for A and B respectively. Then
Question 56
Assume that we use Bubble Sort to sort n distinct elements in ascending order. When does the best case of Bubble Sort occur?
There are 61 questions to complete.