@hackage tensort1.0.1.2

Tunable sorting for responsive robustness and beyond

Categories
- Mathematics
License
MIT
Maintainer
contact@kaBeech.com
Links
Versions
- 1.0.1.2 Thu, 22 Aug 2024
- 1.0.1.1 Thu, 22 Aug 2024
- 1.0.1.0 Thu, 22 Aug 2024
- 1.0.0.0 Thu, 22 Aug 2024
- 0.2.0.3 Sun, 16 Jun 2024
- 0.2.0.2 Thu, 13 Jun 2024

Installation
In your cabal file:
Tested Compilers
- 9.8.2
- 9.6.4
- 9.4.8
- 9.2.8
- 9.2.1
- 9.0.2
- 8.10.7
- 8.8.4
- 8.6.5
- 8.4.4
- 8.2.2
- 8.0.2
- 7.10.3
Dependencies (4)
- base >=4.3.0.0 && <=4.20.0.1
- mtl >=2.2.2 && <2.4
- random >=1.0.0.3 && <1.3
- random-shuffle >=0.0.4 && <0.1
Dependents (0)

A tunable tensor-based structure for sorting algorithms along with various sample configurations. Birthed from an exploration of robustness in algorithms for sorting integers, inspired by Beyond Efficiency by David H. Ackley and Beyond Efficiency by Dave Ackley by Future of Coding.

@hackage tensort1.0.1.2

Categories

License

Maintainer

Links

Versions

Installation

Tested Compilers

Dependencies (4)

Dependents (0)