Question

Which of the following sorting algorithms has average-case and worst-case running time of O (n log n) ?

Answer 1

The sorting algorithms have average-case and worst-case running time of O (n log n): Merge sort, Heap sort, Smooth sort. In our case it is Merge sort.
Answer: (c) Merge sort.