crumsort
awesome-algorithms
crumsort | awesome-algorithms | |
---|---|---|
7 | 34 | |
314 | 17,727 | |
- | - | |
3.6 | 3.1 | |
2 months ago | 10 days ago | |
C | ||
The Unlicense | - |
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-algorithms
-
Anyone interested in contributing to Algorithm opensource with me?
Solved. https://github.com/tayllan/awesome-algorithms
-
I didn't go to a IT/CS school, what's the most important concepts i should learn in computer since that will immensely help me as a dev?
This repo.
-
Could anyone who purchased and completed Leetcodes's interview crash course "Data Structures and Algorithms" tell me if it's worth the 80 dollars?
I found this with zero effort: https://github.com/tayllan/awesome-algorithms. Just pick one of the courses there if you can't make up your mind.
-
Alternative to geeksforgeeks.org ?
https://github.com/tayllan/awesome-algorithms this curated list should be able to help you find more
- Algorithms
-
100+ Must Know Github Repositories For Any Programmer
2. Awesome Algorithms
-
Karimov's "The Complete Data Structures and Algorithms Course in Python" on Udemy?
Also, GitHub: Awesome algorithms — curated list of resources to learn and/or practice algorithms
- Looking for sources similar to this (linked below) but for CS
-
Sorting algorithms visualized using the Blender Python API
See also https://github.com/tayllan/awesome-algorithms for a list of interactive visualizations, learning resources, etc.
-
Best books about computer science theory?
Check out TCS, Algorithms, and Math awesome lists.
What are some alternatives?
fluxsort - A fast branchless stable quicksort / mergesort hybrid that is highly adaptive.
C - Collection of various algorithms in mathematics, machine learning, computer science, physics, etc implemented in C for educational purposes.
SHOGUN - Shōgun
awesome-math - A curated list of awesome mathematics resources
awesome-theoretical-computer
awesome-theoretical-computer-science - The interdicplinary of Mathematics and Computer Science, Distinguisehed by its emphasis on mathemtical technique and rigour.
xeus-cling - Jupyter kernel for the C++ programming language
combsort.h - optimized combsort macro
go - The Go programming language