Difference between revisions of "Merge Sort"
ThomasWard (talk | contribs) (Created page with "Merge sort is an example of a divide and conquer algorithm.") |
|||
| Line 1: | Line 1: | ||
Merge sort is an example of a divide and conquer algorithm. | Merge sort is an example of a divide and conquer algorithm. | ||
| + | |||
| + | It works by splitting all the items in a list into lists of length one, it then combines these in order. | ||
Revision as of 12:04, 5 June 2018
Merge sort is an example of a divide and conquer algorithm.
It works by splitting all the items in a list into lists of length one, it then combines these in order.
