Merge

Array Merge

Merge two sorted arrays into a single sorted array.

Find diagonal partition points that split a sorted merge into independent balanced ranges.

K-way merge using a tournament tree that stores winners at internal nodes and repeatedly updates the winning path.

Efficient k-way merge using a tournament tree that stores losers to reduce comparisons and improve external merge performance.

Sort a sequence by building piles using patience sorting and then merging them.

Accelerate merging by switching from one-by-one comparison to exponential search when one run wins repeatedly.