weissan / BlockQuicksortLinks
☆35Updated 3 years ago
Alternatives and similar repositories for BlockQuicksort
Users that are interested in BlockQuicksort are comparing it to the libraries listed below
Sorting:
- Unstable O(n log n) sorting algorithm with O(n) memory☆61Updated last year
- benchmarking positional population count☆15Updated last year
- ☆44Updated 4 years ago
- AVX512F and AVX2 versions of quick sort☆104Updated 7 years ago
- Boost.Sort☆53Updated 3 weeks ago
- UME::SIMD A library for explicit simd vectorization.☆91Updated 7 years ago
- A Scalable, Portable, and Memory-Efficient Lock-Free FIFO Queue (DISC '19)☆60Updated last year
- Very low-overhead timer/counter interfaces for C on Intel 64 processors.☆135Updated 5 years ago
- Looking into the performance of heaps, starting with the Min-Max Heap☆68Updated 4 years ago
- EDSL for C++ to make just-in-time code generation easier☆86Updated 2 years ago
- Super Scalar Sample Sort in modern C++☆20Updated 4 years ago
- Git mirror of the official (mercurial) repository of cpp-btree☆75Updated 10 years ago
- fast prime sieve and hash algorithm☆38Updated last month
- Fast C header-only library for popcnt, pospopcnt, and set algebraic operations☆45Updated 5 years ago
- Fast random number generators: Vectorized (SIMD) version of xorshift128+☆117Updated 5 years ago
- Vectorized version of the PCG random number generator☆80Updated 4 months ago
- C++ implementation of concurrent Binary Search Trees☆72Updated 9 years ago
- Fastest CPU SIMD (SSE4) sorting networks for small integer arrays (2-6 elements), also optimal amd64 assembly and notes on getting compil…☆47Updated 4 years ago
- In-place Parallel Super Scalar Samplesort (IPS⁴o)☆163Updated 6 months ago
- Cache-friendly associative STL-like container with an Eytzinger (BFS) layout for C++☆32Updated 8 years ago
- An intrusive C++17 implementation of a Red-Black-Tree, a Weight Balanced Tree, a Dynamic Segment Tree and much more!☆128Updated 2 years ago