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

gregreen / smoothsort Public

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

Notifications

Name		Name	Last commit message	Last commit date
Latest commit History 3 Commits
CMakeLists.txt		CMakeLists.txt
README		README
main.cpp		main.cpp
smoothsort.h		smoothsort.h
smoothsort.kdev4		smoothsort.kdev4

Repository files navigation

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

No releases published

No packages published