crumsort
awesome-theoretical-computer-science
crumsort | awesome-theoretical-computer-science | |
---|---|---|
7 | 12 | |
314 | 599 | |
- | - | |
3.6 | 4.0 | |
2 months ago | about 1 month ago | |
C | Python | |
The Unlicense | Creative Commons Zero v1.0 Universal |
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.
crumsort
-
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...
awesome-theoretical-computer-science
- Looking for sources similar to this (linked below) but for CS
-
European theoretical computer science summer schools, conferences or events taking place this summer?
Now that I have a look at it, the Awesome Theoretical Computer Science list seems to be having nice resources.
-
Learning math for Computer Science
Check out Math/Logic preliminaries section in TCS awesome list
-
Best books about computer science theory?
Here is link number 1 - Previous text "TCS"
- Changing std:sort at Google’s Scale and Beyond
-
Theoretical Computer Science Courses
See TCS awesome list
-
What Are You Working On? February 28, 2022
I proudly moderate TCS's subreddit and TCS awesome list. I also do organize online study groups like Erik's algorithms and Math for ML (websites will be updated soon)
-
[P] Invitation for a reference list for machine learning theory
I had contributed before to TCS and Math awesome lists, and it would be nice if you joined your experience to build them up.
-
Advice for Graduate School
See Blog Posts and Essays section here.
-
Mathematics For Computer Science Problemoriented
There is already a TCS awesome list here.
What are some alternatives?
fluxsort - A fast branchless stable quicksort / mergesort hybrid that is highly adaptive.
awesome-oss-alternatives - Awesome list of open-source startup alternatives to well-known SaaS products 🚀
awesome-algorithms - A curated list of awesome places to learn and/or practice algorithms.
SHOGUN - Shōgun
awesome-youtubers - An awesome list of awesome YouTubers that teach about technology. Tutorials about web development, computer science, machine learning, game development, cybersecurity, and more.
awesome-theoretical-computer
combsort.h - optimized combsort macro
go - The Go programming language
computer-science - :mortar_board: Path to a free self-taught education in Computer Science!