glidesort
A Rust implementation of Glidesort, my stable adaptive quicksort/mergesort hybrid sorting algorithm. (by orlp)
sortnetopt
Lower Size Bounds for Sorting Networks (by jix)
| glidesort | sortnetopt | |
|---|---|---|
| 15 | 2 | |
| 1,554 | 39 | |
| - | - | |
| 4.1 | 10.0 | |
| about 1 year ago | over 3 years ago | |
| Rust | Isabelle | |
| - | - |
The number of mentions indicates the total number of mentions that we've tracked plus the number of user suggested alternatives.
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.
glidesort
Posts with mentions or reviews of glidesort.
We have used some of these posts to build our list of alternatives
and similar projects. The last one was on 2023-05-21.
-
A Rust port of crumsort, up to 75% faster than pdqsort
How does this compare to the recent glidesort algorithm? Why should someone prefer this to that one?
-
The Smallest Hash Table
For context this is written by the creator of Glidesort:
https://github.com/orlp/glidesort
- Orlp/glidesort: a Rust implementation of Glidesort, my stable adaptive quicksor
-
Reinforcement learned branchless sorting functions for sort3, sort4 and sort5 were landed in LLVM
With the recent release of Glidesort I remembered this change that recently landed in LLVM.
- Glidesort, a new stable sort in Rust up to ~4x faster for random data
-
Can C++ be the language of choice for new algo development?
In recent years at least one implementation of std sort was replaced by newer algo. Back when it was discussed there was an announcement of other people trying to improve sorting algorithms. Here is example of one https://github.com/orlp/glidesort ( beware it is written in Rust ).
- Show HN: Glidesort, a new stable sort in Rust up to ~4x faster for random data
sortnetopt
Posts with mentions or reviews of sortnetopt.
We have used some of these posts to build our list of alternatives
and similar projects. The last one was on 2023-06-07.
- [R] AlphaDev discovers faster sorting algorithms
-
Reinforcement learned branchless sorting functions for sort3, sort4 and sort5 were landed in LLVM
I'm intimately familiar with these constructs. These constructs are called sorting networks. Optimal solutions in terms of depth up to 16 elements have been known since 'D. E. Knuth. The art of computer programming, vol. 3: Sorting and Searching, 2nd edition. Addison-Wesley, 1998.', no need for fancy machine learning. Although only recently the 11-12 element ones have had their size proven optimally, actually with Rust code https://github.com/jix/sortnetopt.
What are some alternatives?
When comparing glidesort and sortnetopt you can also consider the following projects:
sort-research-rs - Test and benchmark suite for sort implementations.
fluxsort - A fast branchless stable quicksort / mergesort hybrid that is highly adaptive.
BQN - An APL-like programming language. Self-hosted!
abseil-cpp - Abseil Common Libraries (C++)
crumsort-rs - A parallelized Rust port of crumsort
rhsort - Robin Hood Sort, for uniform data
x86-simd-sort - C++ template library for high performance SIMD based sorting algorithms
forma - An efficient vector-graphics renderer
blitsort - Blitsort is an in-place stable adaptive rotate mergesort / quicksort.
highway - Performance-portable, length-agnostic SIMD with runtime dispatch