Set sliders and press space. This sorting algorithm is similar to bottom-up mergesort, but instead of taking fixed sized sublists, it takes sublists either already sorted or reverse sorted, and reverses the ones which are reverse sorted. It starts merging sublists together like bottom-up mergesort until the list is sorted. The advantage is when big parts of the list is sorted, which uses less runs through the list to sort it, and it does fastest on reverse sorted an fully sorted lists.
Thanks to Tim Peters for Timsort.
