Q301
Open questionWhat is the worst case time complexity of bucket sort (k = number of buckets)?
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
16/26
Page
Pick an option on a question to see the right answer and solution.
Q302
Open questionShell sort is an improvement on . . . . . . . .
Select an option to see the answer and solution.
Q303
Open questionWhat is the worst case time complexity of tree sort (when implemented with an unbalanced tree)?
Select an option to see the answer and solution.
Q304
Open questionWhich of the following algorithm takes non linear time for sorting?
Select an option to see the answer and solution.
Q305
Open questionOdd-even sort is a comparison based sort.
Select an option to see the answer and solution.
Q306
Open questionWhich of the following is good for sorting arrays having less than 100 elements?
Select an option to see the answer and solution.
Q307
Open questionWhich of the following sorting techniques is most efficient if the range of input data is not significantly greater than a number of elements to be sorted?
Select an option to see the answer and solution.
Q308
Open questionQuick sort is a space-optimised version of . . . . . . . .
Select an option to see the answer and solution.
Q309
Open questionWhat is the average time complexity of MSD radix sort (w= bits required to store each key)?
Select an option to see the answer and solution.
Q310
Open questionWhat is the average time complexity of stooge sort?
Select an option to see the answer and solution.
Q311
Open questionWhich of the following sorting algorithm has the same time complexity in every case?
Select an option to see the answer and solution.
Q312
Open questionWhat is the average case time complexity of bogosort?
Select an option to see the answer and solution.
Q313
Open questionWhich of the following algorithm takes linear time for sorting?
Select an option to see the answer and solution.
Q314
Open questionWhat is the cut-off for switching from quick sort to heap sort in the implementation of introsort?
Select an option to see the answer and solution.
Q315
Open questionWhat is the auxiliary space complexity of recursive insertion sort?
Select an option to see the answer and solution.
Q316
Open questionWhat is the average case time complexity of gnome sort?
Select an option to see the answer and solution.
Q317
Open questionWhat is the disadvantage of counting sort?
Select an option to see the answer and solution.
Q318
Open questionAuxiliary space used by gnome sort is . . . . . . . .
Select an option to see the answer and solution.
Q319
Open questionWhat is the purpose of using randomized quick sort over standard quick sort?
Select an option to see the answer and solution.
Q320
Open questionWhat is the purpose of using a median of three quick sort over standard quick sort?
Select an option to see the answer and solution.