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.

Bubble sort

Insertion sort

Merge sort

Quick sort.

Expert's answer

Merge sort

Learn more about our help with Assignments: Programming & Computer Science

## Comments

## Leave a comment