Answer to Question #52154 in Programming & Computer Science for irebami

Question

Which of the following sorting algorithms with a time complexity of O(n log(n)) even in the worst case?

Heapsort
Mergesort
Binary
Options A and B

Answer 1

Heapsort and Mergesort sorting algorithms have inworth case complexity. Algorithm divides its input into asorted and an unsorted region, and it iteratively shrinks the unsorted region
by extracting the largest element and moving that to the sorted region.

Heapsortalso competes with merge sort, which has the same time bounds. Merge sort
requires Ω(n) auxiliary space, but heapsort requires only a constant amount.
Heapsort typically runs faster in practice on machines with small or slow data
caches. On the other hand, merge sort has several advantages over heapsort:

Answer: Options A and B