smoothsort. Implementation of Edsger Dijkstra's smoothsort algorithm, which has O(NlogN) worst-case and O(N) best-case runtime, with O(1) overhead.

github.com/gregreen/smoothsort
by @gregreen

Problem

Audience

Keep exploring

Updates

No founder updates yet. Check back soon.