Timsort
Timsort is an O(n log n) sorting algorithm
built for the real world

@Brandon.codes






If the array has more than 64 elements:

>Perform insertion sort

Else

>Find natural sections of the list that are in ascending order

>Perform merge sort on these sections

>Merge with the rest of the list