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:

Explain how merge sort works

Author: Will Parker



Answer:

Divide the unsorted list into n sublists, each containing 1 element Repeatedly merge sublists to produce new sorted sublists until there is only 1 sublist remaining This list is sorted


0 / 5  (0 ratings)

1 answer(s) in total