Question: Which of the following sorting algorithms yield approximately the same worst-case and average-case running time behavior in O(n*log(n))?
A
B
C
D
Bubble sort and selection sort
B
Heap sort and merge sort
C
Quick sort and radix sort
D
Tree sort and Median-of-3 quicksort
Note: Not available