Answer to Question #52149 in Programming & Computer Science for ayansola promise

Question

Which sort is an O(n log n) comparison-basedsorting algorithm?

Quicksort
Mergesort
divide and conquer
Binary

Answer 1

a.Quicksort
b.Mergesort

There are two classes of sorting algorithms namely, O(n²) - algorithms and O(n log n)-algorithms. O(n²)-class includes bubble sort, insertion sort,selection sort and shell sort. O(n log n)-class includes heap sort, merge sort
and quick sort.