A sorting algorithm so efficient, you'll want to merge with your ex.
The Process
Take a list of items, split them in half, and merge the middle back together.
- Split the list in half until it's just one item.
- Split that one item in half, revealing its inner workings.
- Recombine the halves, and voilà! A sorted list.
Learn more about the theory behind merge sort
