Which of the following sorting algorithms is used along with quick sort to sort the sub arrays?

Related MCQs

• How many sub arrays does the quick sort algorithm divide the entire array into?
• Which of the following sorting algorithms is the fastest?
• Quick sort follows Divide-and-Conquer strategy.
• What is the worst case time complexity of a quick sort algorithm?
• What is the average running time of a quick sort algorithm?
• Quick sort uses join operation rather than merge operation.
• Recursive selection sort is a comparison based sort.
• What is the number of swaps required to sort the array arr={5,3,2,4,1} using recursive selection sort?
• Which of the following sorting algorithm has best case time complexity of O(n2)?
• Which of the following sorting algorithm is NOT stable?