41. Which of the following don't affect the time complexity of bucket sort?
42. Tim sort begins sorting the given array by using which of the following sorting algorithm?
43. What is the average case time complexity of recursive bubble sort?
44. What is the auxiliary space complexity of standard merge sort?
45. What is the median of three techniques in quick sort?
46. Which of the following is not true about radix sort?
47. The Pancake Problems (1975, 1979, 1973) did NOT involve which of the following people?
48. Consider the code given below, which runs insertion sort:
void insertionSort(int arr[], int array_size)
{
int i, j, value;
for (i = 1; i < array_size; i++)
{
value = arr[i];
j = i;
while (________ )
{
arr[j] = arr[j − 1];
j = j − 1;
}
arr[j] = value;
}
}
Which condition will correctly implement the while loop?
void insertionSort(int arr[], int array_size)
{
int i, j, value;
for (i = 1; i < array_size; i++)
{
value = arr[i];
j = i;
while (________ )
{
arr[j] = arr[j − 1];
j = j − 1;
}
arr[j] = value;
}
}49. Insertion sort is an online sorting algorithm.
50. LSD radix sort is faster than comparison sorts.
Read More Section(Sorting Algorithms)
Each Section contains maximum 100 MCQs question on Sorting Algorithms. To get more questions visit other sections.