GitHub - BonzaiThePenguin/WikiSort: Fast and stable sort algorithm that uses O(1) memory. Public domain.

WikiSort is an implementation of "block merge sort", which is a stable merge sort based on the work described in "Ratio based stable in-place merging", by Pok-Son Kim and Arne Kutzner [PDF]. It's generally as fast as a standard merge sort while using O(1) memory, and can be modified to use additional memory optionally provided to it which can further improve its speed. C, C++, and Java versions ar

[tmatsuu]

Fast and stable merge sort algorithm that uses O(1) memory

[fcicq]

a fast and stable in-place merge. with tutorial in designing