tensort: Reasonably robust sorting in O(n log n) time
An exploration of robustness in algorithms for sorting integers, inspired by Beyond Efficiency by David H. Ackley
Modules
- Data
- Data.Tensort
- OtherSorts
- Data.Tensort.OtherSorts.Mergesort
- Data.Tensort.OtherSorts.Quicksort
- Data.Tensort.Robustsort
- Subalgorithms
- Data.Tensort.Subalgorithms.Bogosort
- Data.Tensort.Subalgorithms.Bubblesort
- Data.Tensort.Subalgorithms.Magicsort
- Data.Tensort.Subalgorithms.Permutationsort
- Data.Tensort.Subalgorithms.ReverseExchangesort
- Data.Tensort.Subalgorithms.Supersort
- Data.Tensort.Tensort
- Utils
- Data.Tensort.Utils.RandomizeList
- Data.Tensort.Utils.Types
- OtherSorts
- Data.Tensort
Downloads
- tensort-0.1.0.0.tar.gz [browse] (Cabal source package)
- Package description (as included in the package)
Maintainer's Corner
For package maintainers and hackage trustees
Candidates
- No Candidates
Versions [RSS] | 0.1.0.0, 0.2.0.0, 0.2.0.1, 0.2.0.2, 0.2.0.3, 1.0.0.0, 1.0.1.0, 1.0.1.1, 1.0.1.2, 1.0.1.3, 1.0.1.4, 1.1.0.0 |
---|---|
Change log | CHANGELOG.md |
Dependencies | base (>=4.18.2.0 && <4.19), mtl (>=2.3.1 && <2.4), random (>=1.2.1 && <1.3), random-shuffle (>=0.0.4 && <0.1), tensort, time (>=1.12.2 && <1.13) [details] |
License | MIT |
Copyright | 2024 Kyle Beechly |
Author | Kyle Beechly |
Maintainer | contact@kaBeech.com |
Category | Math, Data |
Uploaded | by kaBeech at 2024-05-30T07:21:56Z |
Distributions | LTSHaskell:1.0.1.4, NixOS:1.0.1.3, Stackage:1.1.0.0 |
Executables | tensort |
Downloads | 435 total (3 in the last 30 days) |
Rating | 2.0 (votes: 1) [estimated by Bayesian average] |
Your Rating | |
Status | Docs not available [build log] All reported builds failed as of 2024-05-30 [all 2 reports] |