Fast and stable sort algorithm that uses O(1) memory. Public domain.
☆1,288Dec 14, 2021Updated 4 years ago
Alternatives and similar repositories for WikiSort
Users that are interested in WikiSort are comparing it to the libraries listed below
Sorting:
- Stable In-place sorting in O(n*log(n)) worst time☆196Jul 20, 2023Updated 2 years ago
- A diverse array of heavily refactored versions of Andrey Astrelin's GrailSort.h, aiming to be as readable and intuitive as possible☆55Dec 8, 2024Updated last year
- new stable in-place sorting algorithms☆12Oct 23, 2025Updated 4 months ago
- O(n log n) In-place Stable Quicksort☆22Aug 7, 2025Updated 7 months ago
- Refactoring of Grail Sort by Andrey Astrelin (https://github.com/Mrrl/GrailSort/blob/master/GrailSort.h) from C to Java.☆16Aug 17, 2019Updated 6 years ago
- logging library for rayon☆17Sep 14, 2020Updated 5 years ago
- Sorting algorithm quicker than MergeSort, and is adaptive and stable.☆40Jun 29, 2022Updated 3 years ago
- Bitset Sort, a faster std::sort replacement.☆79Feb 2, 2022Updated 4 years ago
- ☆13Apr 27, 2025Updated 10 months ago
- Robin Hood Sort, for uniform data☆76Jun 2, 2023Updated 2 years ago
- Pattern-defeating quicksort.☆2,475Dec 6, 2023Updated 2 years ago
- Lua bindings for Wt☆13Oct 19, 2019Updated 6 years ago
- make_heap and sort_heap for a poplar heap with O(1) extra memory☆40Mar 13, 2026Updated last week
- Sorting algorithms & related tools for C++☆701Updated this week
- Fast caclulation of the coordinates of the nth point of the Hilbert curve☆16Jan 31, 2019Updated 7 years ago
- Fastest Integer Compression☆828Mar 1, 2024Updated 2 years ago
- Experimental project that allows a process to submit UI elements to a Dear ImGui context hosted by another☆13Oct 30, 2020Updated 5 years ago
- Official git repository for libdivide: optimized integer division☆1,303Mar 5, 2026Updated 2 weeks ago
- Fork of icculus's HLSL Bytecode -> GLSL translator with tweaks for MonoGame☆15May 28, 2023Updated 2 years ago
- A path finding algorithm for non-grid-based environments.☆12Mar 5, 2023Updated 3 years ago
- XWRT (XML-WRT) is an efficient XML/HTML/text compressor☆44Aug 25, 2016Updated 9 years ago
- LuaJIT General Purpose Routines☆15Feb 11, 2021Updated 5 years ago
- Super Scalar Sample Sort in modern C++☆21Sep 30, 2020Updated 5 years ago
- Simple category-based logger generator for C/C++☆10Oct 23, 2016Updated 9 years ago
- In-place Parallel Super Scalar Samplesort (IPS⁴o)☆166Jan 15, 2025Updated last year
- Texture Compression Techniques in DuckTales Remastered☆17Jul 11, 2016Updated 9 years ago
- Parallel Stable Sort☆15Oct 11, 2015Updated 10 years ago
- Fast integer compression in C using the StreamVByte codec☆413Feb 9, 2025Updated last year
- A C++ implementation of timsort☆315Dec 3, 2024Updated last year
- My C libraries☆26Sep 1, 2025Updated 6 months ago
- Demo projects using virt86☆13Jul 5, 2019Updated 6 years ago
- Sorting routine implementations in "template" C☆473Feb 13, 2024Updated 2 years ago
- Quadsort is a branchless stable adaptive mergesort faster than quicksort.☆2,206Jul 27, 2024Updated last year
- Radix sort revisited again☆26Mar 20, 2018Updated 8 years ago
- ☆245Apr 3, 2021Updated 4 years ago
- Is a linear data structure with O(log n) searches and O(cbrt n) insertions and index lookups.☆29Feb 22, 2021Updated 5 years ago
- Lizard is an efficient compressor with very fast decompression. It achieves compression ratio that is comparable to zip/zlib and zstd/bro…☆700Oct 9, 2025Updated 5 months ago
- Experimental/work-in-progress code☆11Sep 3, 2019Updated 6 years ago
- C++ reimplementation of https://github.com/emilk/drop-merge-sort☆21Dec 6, 2021Updated 4 years ago