Q461
Open questionOn which algorithm is heap sort based on?
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
24/26
Page
Pick an option on a question to see the right answer and solution.
Q462
Open questionWhich of the following is not true about QuickSort?
Select an option to see the answer and solution.
Q463
Open questionWhat is the average case time complexity of tree sort?
Select an option to see the answer and solution.
Q464
Open questionWhich of the following is an advantage of recursive insertion sort over its iterative version?
Select an option to see the answer and solution.
Q465
Open questionConsider the following statements related to the binary tree sort.
I. Element can be added gradually as they become available
II. It needs extra memory space
I. Element can be added gradually as they become available
II. It needs extra memory space
Select an option to see the answer and solution.
Q466
Open questionWhat is the average time complexity of Tim sort?
Select an option to see the answer and solution.
Q467
Open questionWhat is a randomized QuickSort?
Select an option to see the answer and solution.
Q468
Open questionWhich of the following is not an exchange sort?
Select an option to see the answer and solution.
Q469
Open questionStooge sort is a comparison based sorting algorithm.
Select an option to see the answer and solution.
Q470
Open questionBead sort is only applicable to positive integers.
Select an option to see the answer and solution.
Q471
Open questionWhat will be the number of passes to sort the elements using insertion sort?
14, 12,16, 6, 3, 10
14, 12,16, 6, 3, 10
Select an option to see the answer and solution.
Q472
Open questionWhich of the following is incorrect about randomized quicksort?
Select an option to see the answer and solution.
Q473
Open questionWhich of the following is an alternate name of library sort?
Select an option to see the answer and solution.
Q474
Open questionWhich of the following traversal in a binary search tree results in a sorted output?
Select an option to see the answer and solution.
Q475
Open questionWhat is the best case time complexity of Tim sort?
Select an option to see the answer and solution.
Q476
Open questionWhat is the advantage of counting sort over quick sort?
Select an option to see the answer and solution.
Q477
Open questionWhat is the worst case time complexity of bead sort (S= sum of input elements)?
Select an option to see the answer and solution.
Q478
Open questionWhat is the best case time complexity of bead sort (S = sum of input elements)?
Select an option to see the answer and solution.
Q479
Open questionLSD radix sort requires . . . . . . . . passes to sort N elements.
Select an option to see the answer and solution.
Q480
Open questionWhat is a randomized quick sort?
Select an option to see the answer and solution.