Timsort implementation is wrong #179
Description
The way timsort is written isn't actually timsort, it's just merge sort but replacing the smallest merges with selection sort.
It should be looking for "runs" of already sorted elements and merging then together.