Which of the following sorting algorithms is used along with quick sort to sort the sub arrays?
A. Merge sort
B. Shell sort
C. Insertion sort
D. Bubble sort
Answer: Option C
A. Merge sort
B. Shell sort
C. Insertion sort
D. Bubble sort
Answer: Option C
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