Q141
Open questionWhich of the following don't affect the time complexity of bucket sort?
Select an option to see the answer and solution.
Data Structure · all questionsSorting Algorithms
Sorting Algorithms
practice.
Practice every MCQ with options. Use Show answers when you want the correct option and solution.
509
Questions
8/26
Page
Pick an option on a question to see the right answer and solution.
Q142
Open questionTim sort begins sorting the given array by using which of the following sorting algorithm?
Select an option to see the answer and solution.
Q143
Open questionWhat is the average case time complexity of recursive bubble sort?
Select an option to see the answer and solution.
Q144
Open questionWhat is the auxiliary space complexity of standard merge sort?
Select an option to see the answer and solution.
Q145
Open questionWhat is the median of three techniques in quick sort?
Select an option to see the answer and solution.
Q146
Open questionWhich of the following is not true about radix sort?
Select an option to see the answer and solution.
Q147
Open questionThe Pancake Problems (1975, 1979, 1973) did NOT involve which of the following people?
Select an option to see the answer and solution.
Q148
Open questionConsider 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;
}
}Select an option to see the answer and solution.
Q149
Open questionInsertion sort is an online sorting algorithm.
Select an option to see the answer and solution.
Q150
Open questionLSD radix sort is faster than comparison sorts.
Select an option to see the answer and solution.
Q151
Open questionThe 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?
Select an option to see the answer and solution.
Q152
Open questionBrick sort uses which of the following methods for sorting the input?
Select an option to see the answer and solution.
Q153
Open questionWhat is the average time complexity of bead sort (S = sum of input elements)?
Select an option to see the answer and solution.
Q154
Open questionWhich of the following is an advantage of binary insertion sort over its standard version?
Select an option to see the answer and solution.
Q155
Open questionSleep sort does gives a correct output when . . . . . . . .
Select an option to see the answer and solution.
Q156
Open questionWhich of the following sorting algorithm is not stable . . . . . . . .
Select an option to see the answer and solution.
Q157
Open questionWhich of the following sorting algorithm is not in-place?
Select an option to see the answer and solution.
Q158
Open questionBinary insertion sort is a comparison based sort.
Select an option to see the answer and solution.
Q159
Open questionWhat is the running time of an insertion sort algorithm if the input is pre-sorted?
Select an option to see the answer and solution.
Q160
Open questionWhat is the space complexity of stooge sort?
Select an option to see the answer and solution.