csnotes/370/notes/2.md

Divide and Conquer

Make big problem into smaller problems to solve

Merge Sort

yote

1. find midpoint of list
2. split into two smaller lists
3. keep splitting smaller lists until we have a bunch of 1/2 size lists
4. sort each using the smaller already sorted values against each other into a new sub-list
5. combine and sort each thing