JamesQuintero / ShiftSortLinks
Sorting algorithm quicker than MergeSort, and is adaptive and stable.
☆40Updated 3 years ago
Alternatives and similar repositories for ShiftSort
Users that are interested in ShiftSort are comparing it to the libraries listed below
Sorting:
- multi-way atomic compare-and-swap with x64/TSX☆86Updated 8 years ago
- compile time assembly interpreter☆86Updated 7 years ago
- ☆31Updated 9 years ago
- A hash table implementation using Robin Hood Linear Probing☆51Updated 11 years ago
- bit & sketches data structures☆60Updated 7 years ago
- A collection of clang plugins for safer C programming☆92Updated 7 years ago
- C++ reimplementation of https://github.com/emilk/drop-merge-sort☆21Updated 4 years ago
- Support for Currying and Function Composition in C++☆61Updated 10 years ago
- Propositional Encodings in C++11☆18Updated 7 years ago
- Work-in-progress Rust application that converts C++ header-only libraries to single self-contained headers.☆26Updated 6 years ago
- Counting the collisions with perl hash tables per function☆12Updated 6 years ago
- Benchmark showing the we can randomly hash strings very quickly with good universality☆139Updated 10 months ago
- A dependency-based coroutine scheduler☆45Updated 9 years ago
- Coroutines/Fibers implementation for x86☆65Updated 9 years ago
- Bloom filter alternative (C++)☆18Updated 7 years ago
- a series of trie testing things☆21Updated 8 years ago
- Demontrates the power and simplicity of writing C++ programs in the data abstraction-style.☆42Updated 7 years ago
- A colorful C++ type name demangler (like c++filt, but fancier)☆21Updated 10 years ago
- A collection of CMake examples for demonstration purposes.☆19Updated 5 years ago
- Many functions in C for sorting the nibbles in an 8-byte word☆33Updated 10 years ago
- Profile what you care, monitor how it goes (support C/C++)☆91Updated 8 years ago
- Fastest CPU SIMD (SSE4) sorting networks for small integer arrays (2-6 elements), also optimal amd64 assembly and notes on getting compil…☆52Updated 4 years ago
- Optimized for systems that read and write large blobs.☆12Updated 10 years ago
- A library for Study Group 14 of Working Group 21 (C++)☆34Updated 8 years ago
- A novel adaptive sorting algorithm☆176Updated 3 years ago
- Experiments with array layouts for comparison-based searching☆85Updated last year
- Quick 'n' Dirty benchmarks for various integer parsing methods in C++☆41Updated 5 years ago
- Cool trick to store 4 5-bit values in one 16-bit value.☆285Updated 5 years ago
- A C++14 framework for asynchronous I/O, cooperative multitasking and green threads scheduling☆160Updated 7 years ago
- Popular hash table implementation benchmarks☆27Updated 8 years ago