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

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.
1
Expert's answer
2015-04-24T03:16:31-0400
Merge 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 the first!

Leave a comment

Ask Your question

LATEST TUTORIALS
New on Blog
APPROVED BY CLIENTS