https://github.com/juhp/hs-reverse-sort

Simple benchmarks for reverse sorting in Haskell base
https://github.com/juhp/hs-reverse-sort

Last synced: 17 days ago
JSON representation

Simple benchmarks for reverse sorting in Haskell base

• Host: GitHub
• URL: https://github.com/juhp/hs-reverse-sort
• Owner: juhp
• License: bsd-3-clause
• Created: 2020-04-20T11:07:14.000Z (over 4 years ago)
• Default Branch: master
• Last Pushed: 2020-04-20T13:04:42.000Z (over 4 years ago)
• Last Synced: 2024-10-31T14:06:09.699Z (2 months ago)
• Language: Haskell
• Size: 1.95 KB
• Stars: 0
• Watchers: 3
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md
  • License: LICENSE

Awesome Lists containing this project

README

        
# Descending sort in Haskell

Here are the benchmarks from [Roman Cheplyaka's nice article](https://ro-che.info/articles/2016-04-02-descending-sort-haskell), extended with `reverse . sort` and `sortWith`.

See also this related [hlint hint discussion](https://github.com/ndmitchell/hlint/issues/669).

For typical (newtype-based) sorting, the fastest is sortBy (or sortWith).