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

Question #52149
Which sort is an O(n log n) comparison-basedsorting algorithm? 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.

Need a fast expert's response?

Submit order

and get a quick answer at the best price

for any assignment or question with DETAILED EXPLANATIONS!

Comments

No comments. Be first!

Leave a comment

Ask Your question

LATEST TUTORIALS
New on Blog
APPROVED BY CLIENTS
paypal