SEARCH
You are in browse mode. You must login to use MEMORY

   Log in to start


From course:

Computer Science AQA A level

» Start this Course
(Practice similar questions for free)
Question:

Whats the worse case and average case complexity for any merge sort algorithm?

Author: Will Parker



Answer:

O(n log n)


0 / 5  (0 ratings)

1 answer(s) in total