Galloping Merge
Accelerate merging by switching from one-by-one comparison to exponential search when one run wins repeatedly.
Tag
Timsort
3 notes
3 notes
Accelerate merging by switching from one-by-one comparison to exponential search when one run wins repeatedly.
Detect natural runs in input and normalize them for efficient merging in Timsort.
Adaptive stable sorting algorithm that combines merge sort with run detection and insertion sort.