nagusamecs.github.io/HyperTensor/sort

HyperSort

Live algorithm comparison. HyperSort replaces O(n log n) sequential compares with a single O(1)-step matrix multiply — all n² pairs in parallel. Use the speed slider to watch each algorithm step.

48 10×