Of the sorting algorithms that we have studied which require

Of the sorting algorithms that we have studied, which require one or more auxiliary arrays? Bubble Sort Quicksort Merge Sort Heap Sort Selection Sort All of the above None of the above

Solution

a. Bubble Sort: we do not need auxilary array
b. QuickSort: we do not need
c. Merger Sort: Yes, we need auxilary array to store temporarly sorted subarray before merging

d. Heap Sort: We do not need auxilary array
e. Selection Sort: We do not need