Question: Select all the statements below which are TRUE: Heapsort and Merge sort are asymptotically optimal comparison sorts. Any sorting algorithm has running time Theta (n)

Select all the statements below which are TRUE: Heapsort and Merge sort are asymptotically optimal comparison sorts. Any sorting algorithm has running time Theta (n) since it has to traverse the sequence of elements. Quick sort is not a comparison sort because it calls the PARTITION function. Insertion sort is an asymptotically optimal comparison sort. Bucket sort is not a comparison sort. Any comparison sort algorithm requires Ohm (nlgn) comparisons in the worst case
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
