Question #52149
Which sort is an O(n log n) comparison-basedsorting algorithm?
Quicksort
Mergesort
divide and conquer
Binary
Quicksort
Mergesort
divide and conquer
Binary
Expert's answer
a.Quicksort
b.Mergesort
There are two classes of sorting algorithms namely, O(n2) - algorithms and O(n log n)-algorithms. O(n2)-class includes bubble sort, insertion sort,selection sort and shell sort. O(n log n)-class includes heap sort, merge sort
and quick sort.
b.Mergesort
There are two classes of sorting algorithms namely, O(n2) - algorithms and O(n log n)-algorithms. O(n2)-class includes bubble sort, insertion sort,selection sort and shell sort. O(n log n)-class includes heap sort, merge sort
and quick sort.
