Get real-time insights from all types of time series data with InfluxDB. Ingest, query, and analyze billions of data points in real-time with unbounded cardinality. Learn more →
Crumsort Alternatives
Similar projects and alternatives to crumsort
-
-
-
InfluxDB
Power Real-Time Data Analytics at Scale. Get real-time insights from all types of time series data with InfluxDB. Ingest, query, and analyze billions of data points in real-time with unbounded cardinality.
-
awesome-theoretical-computer-science
The interdicplinary of Mathematics and Computer Science, Distinguisehed by its emphasis on mathemtical technique and rigour.
-
-
WorkOS
The modern identity platform for B2B SaaS. The APIs are flexible and easy-to-use, supporting authentication, user identity, and complex enterprise features like SSO and SCIM provisioning.
-
NOTE:
The number of mentions on this list indicates mentions on common posts plus user suggested alternatives.
Hence, a higher number means a better crumsort alternative or higher similarity.
crumsort reviews and mentions
Posts with mentions or reviews of crumsort.
We have used some of these posts to build our list of alternatives
and similar projects. The last one was on 2022-11-30.
-
Blitsort: An ultra-fast in-place stable hybrid merge/quick sort
Blitsort is a hybrid quicksort, see title.
It is slower than it's unstable brother, aptly named crumsort. https://github.com/scandum/crumsort
- Crumsort: Introduction to a new unstable sorting algorithm faster than pdqsort
- 380 points in 6 hours
- Crumsort: Introduction to a new sorting algorithm faster than pdqsort
-
Go will use pdqsort in the next release
https://github.com/scandum/crumsort claims better performance than pdqsort
-
Changing std:sort at Google’s Scale and Beyond
Any chance you could comment on fluxsort[0], another fast quicksort? It's stable and uses a buffer about the size of the original array, which sounds like it puts it in a similar category as glidesort. Benchmarks against pdqsort at the end of that README; I can verify that it's faster on random data by 30% or so, and the stable partitioning should mean it's at least as adaptive (but the current implementation uses an initial analysis pass followed by adaptive mergesort rather than optimistic insertion sort to deal with nearly-sorted data, which IMO is fragile). There's an in-place effort called crumsort along similar lines, but it's not stable.
I've been doing a lot of work on sorting[2], in particular working to hybridize various approaches better. Very much looking forward to seeing how glidesort works.
[0] https://github.com/scandum/fluxsort
[1] https://github.com/scandum/crumsort
[2] https://mlochbaum.github.io/BQN/implementation/primitive/sor...
-
A note from our sponsor - InfluxDB
www.influxdata.com | 24 Apr 2024
Stats
Basic crumsort repo stats
7
314
3.6
2 months ago
scandum/crumsort is an open source project licensed under The Unlicense which is not an OSI approved license.
The primary programming language of crumsort is C.
Sponsored
SaaSHub - Software Alternatives and Reviews
SaaSHub helps you find the best software and product alternatives
www.saashub.com