Summary

Andrey Astrelin’s GrailSort collects distinct internal keys, builds sorted blocks, combines those blocks, then merges the reserved keys back into the result. This visualization runs the original C++ algorithm compiled to WebAssembly and records its comparisons and writes.

How it Works

• Collect distinct internal keys and, when possible, a work buffer inside the input.

• Build small sorted blocks and combine them with tagged block merges.

• Sort the reserved keys and merge them with the rest of the array.