Following Algorithms Runs O N 2 Worst Case Time Heapsort C Mergesort D Quicksort E Shellso Q37293782

which of the following algorithms runs in O(N^2) inthe worst case time?
(a) heapsort
(c) mergesort
(d) quicksort
(e) shellsort

Answer

(d) quicksort

​​​​​​​