Which of the following is true?
A. Shell sort's passes completely sort the elements before going on to the next-smallest gap while Comb sort's passes do not completely sort the elements
B. Shell sort's passes do not completely sort the elements before going on to the next-smallest gap like in Comb sort
C. Comb sort's passes completely sort the elements before going on to the next-smallest gap like in Shell sort
D. Shell sort's passes do not completely sort the elements before going on to the next-smallest gap while Comb sort's passes completely sort the elements
Answer: Option A
This Question Belongs to Data Structure >> 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