@hackage tensort0.1.0.0

Reasonably robust sorting in O(n log n) time

Installation
In your cabal file:
Dependencies (4)
- base ^>=4.18.2.0
- mtl >=2.3.1 && <2.4
- random >=1.2.1 && <1.3
- random-shuffle >=0.0.4 && <0.1
Dependents (0)

An exploration of robustness in algorithms for sorting integers, inspired by Beyond Efficiency by David H. Ackley