Bubble sort performs better as compared to cocktail sort.
Select an option to see the answer and solution.
Which of the following is an advantage of cycle sort?
A. it can sort large arrays efficiently
B. it has a low time complexity
C. it requires minimal write operations
D. it is an adaptive sorting algorithm
Select an option to see the answer and solution.
Consider the Quick sort algorithm which sorts elements in ascending order using the first element as pivot. Then which of the following input sequence will require a maximum number of comparisons when this algorithm is applied on it?
A. 22 25 56 67 89
B. 52 25 76 67 89
C. 22 25 76 67 50
D. 52 25 89 67 76
Select an option to see the answer and solution.
Sleep sort is an in-place sorting technique.
Select an option to see the answer and solution.
Which of the following sorting techniques is stable?
A. quick sort
B. counting sort
C. heap sort
D. selection sort
Select an option to see the answer and solution.
Which of the following sorting algorithm makes use of merge sort?
A. tim sort
B. intro sort
C. bogo sort
D. quick sort
Select an option to see the answer and solution.
Merge sort uses which of the following algorithm to implement sorting?
A. backtracking
B. greedy algorithm
C. divide and conquer
D. dynamic programming
Select an option to see the answer and solution.
What is the average time complexity of bottom up merge sort?
A. O(n log n)
B. O(n2 )
C. O(n2 log n)
D. O(n log n2 )
Select an option to see the answer and solution.
Which of the following is a combination of LSD and MSD radix sorts?
A. Forward radix sort
B. 3-way radix quick sort
C. Trie base radix sort
D. Flash sort
Select an option to see the answer and solution.
How many comparisons will be made to sort the array arr={1, 5, 3, 8, 2} using counting sort?
Select an option to see the answer and solution.
In place merge sort has same time complexity as standard merge sort.
Select an option to see the answer and solution.
Odd-even sort is also known as . . . . . . . .
A. stupid sort
B. smart sort
C. brick sort
D. bogo sort
Select an option to see the answer and solution.
In what position does the array for heap sort contains data?
A. 0
B. 1
C. -1
D. anywhere in the array
Select an option to see the answer and solution.
Strand sort is most efficient for data stored in?
A. linked list
B. arrays
C. trees
D. graphs
Select an option to see the answer and solution.
What is the average time complexity of strand sort?
A. O(n)
B. O(n log n)
C. O(n2 )
D. O(n2 log n)
Select an option to see the answer and solution.
What is the auxiliary space complexity of binary insertion sort?
A. O(n)
B. O(1)
C. O(n log n)
D. O(n2 )
Select an option to see the answer and solution.
Bubble sort is an adaptive sorting algorithm.
Select an option to see the answer and solution.
How many comparisons will be made to sort the array arr={1, 5, 3, 8, 2} using pigeonhole sort?
Select an option to see the answer and solution.
The auxiliary array used in pigeonhole sorting is called . . . . . . . .
A. bucket
B. pigeon
C. hole
D. pigeonhole
Select an option to see the answer and solution.
Odd-even sort is a variation of . . . . . . . .
A. Bubble sort
B. Selection sort
C. Insertion sort
D. Gnome sort
Select an option to see the answer and solution.