Following Algorithms Runs O N Log N Average Time O N 2 Worst Case Time Heapsort B Insertio Q37293993

Which of the following algorithms runs in O(n log n)average time but O(N^2) worst-case
time?
(a) heapsort
(b) insertion sort
(c) mergesort
(d) quicksort
(e) shellsort

Answer

(d) quicksort