What is the first step in the algorithm of stooge sort(after base case)?
A. apply stooge sort on first 2/3 elements of array
B. apply stooge sort on last 2/3 elements of array
C. apply stooge sort on first 1/3 elements of array
D. compare first and last element of the array
Answer: Option D
This Question Belongs to Data Structure >> Sorting Algorithms
Related Questions on Sorting Algorithms
What is the time complexity of Bubble Sort in the average case?
A. O(n log n)
B. O(n)
C. O(n2)
D. O(n3)
Which sorting algorithm is based on the divide-and-conquer strategy?
A. Insertion Sort
B. Quick Sort
C. Selection Sort
D. Insertion Sort
Which sorting algorithm uses a "pivot" element to partition the array into sub-arrays?
A. Merge Sort
B. Heap Sort
C. Counting Sort
D. Quick Sort
Join The Discussion