# Answer to Question #58890 in Other Programming & Computer Science for David Williams

Question #58890

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

Expert's answer

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.

Answer: (c) Merge sort.

Need a fast expert's response?

Submit orderand get a quick answer at the best price

for any assignment or question with DETAILED EXPLANATIONS!

## Comments

## Leave a comment