Merge Sort

Recursively dividing an array into smaller sub-arrays, then merging them back together to get a fully sorted array. Is $O(n{\log }_2(n))$ time

Merging Algorithm

1. Split up the list into sub-arrays of 1
2. Check which sub-list is smaller than the other, and merge in proper order

Pseudocode