Answer to Question #52148 in Other 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.
Expert's answer
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 first!

Leave a comment

Ask Your question

LATEST TUTORIALS
New on Blog
APPROVED BY CLIENTS
paypal