Question #52148

Which of the following sorting algorithms has average-case and worst-case running time of O (n log n) ?
Bubble sort
Insertion sort
Merge sort
Quick sort.

Expert's answer

Merge sort

## Comments

## Leave a comment