tensort: Reasonably robust sorting in O(n log n) time

[ data, library, math, mit, program ] [ Propose Tags ]

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

Modules

[Last Documentation]

  • 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

Downloads

Maintainer's Corner

Package maintainers

For package maintainers and hackage trustees

Candidates

Versions [RSS] 0.1.0.0, 0.2.0.0, 0.2.0.1, 0.2.0.2, 0.2.0.3
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 NixOS:0.2.0.3, Stackage:0.2.0.3
Executables tensort
Downloads 85 total (65 in the last 30 days)
Rating (no votes yet) [estimated by Bayesian average]
Your Rating
  • λ
  • λ
  • λ
Status Docs not available [build log]
All reported builds failed as of 2024-05-30 [all 2 reports]