Oscillating merge sort
Oscillating merge sort or oscillating sort is a variation of merge sort used with tape drives that can read backwards.  Instead of doing a complete distribution as is done in a tape merge, the distribution of the input and the merging of runs are interspersed.  The oscillating merge sort does not waste rewind time or have tape drives sit idle as in the conventional tape merge.

The oscillating merge sort "was designed for tapes that can be read backward and is more efficient generally than either the polyphase or cascade merges."

References

Further reading

External links
Mihaldinecz, Maximilian (2016), "A variation of Oscillating Merge Sort implemented in Matlab", GitHub

Sorting algorithms
Comparison sorts
Stable sorts