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. We may earn a commission when you buy through links labeled 'Ad' on this page.
Sorting:
- Stable In-place sorting in O(n*log(n)) worst time☆198Jul 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☆56Dec 8, 2024Updated last year
- Stable sorting with O(sqrt(N)) external memory☆12Aug 2, 2024Updated last year
- O(n log n) In-place Stable Quicksort☆24Aug 7, 2025Updated 10 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
- Serverless GPU API endpoints on Runpod - Get Bonus Credits • AdSkip the infrastructure headaches. Auto-scaling, pay-as-you-go, no-ops approach lets you focus on innovating your application.
- Ultra fast MSD radix sorter☆10Jun 23, 2020Updated 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 4 years ago
- ☆13Apr 27, 2025Updated last year
- Bitset Sort, a faster std::sort replacement.☆81Feb 2, 2022Updated 4 years ago
- Robin Hood Sort, for uniform data☆78Jun 2, 2023Updated 3 years ago
- Pattern-defeating quicksort.☆2,498Dec 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 3 months ago
- Virtual machines for every use case on DigitalOcean • AdGet dependable uptime with 99.99% SLA, simple security tools, and predictable monthly pricing with DigitalOcean's virtual machines, called Droplets.
- a stable sort using sqrt(n) memory☆21Feb 22, 2023Updated 3 years ago
- Sorting algorithms & related tools for C++☆712Jun 3, 2026Updated 3 weeks ago
- Fast caclulation of the coordinates of the nth point of the Hilbert curve☆16Jan 31, 2019Updated 7 years ago
- Fastest Integer Compression☆835Apr 16, 2026Updated 2 months 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
- Fork of icculus's HLSL Bytecode -> GLSL translator with tweaks for MonoGame☆15May 28, 2023Updated 3 years ago
- Official git repository for libdivide: optimized integer division☆1,337Jun 19, 2026Updated last week
- XWRT (XML-WRT) is an efficient XML/HTML/text compressor☆44Aug 25, 2016Updated 9 years ago
- Super Scalar Sample Sort in modern C++☆21Sep 30, 2020Updated 5 years ago
- Deploy on Railway without the complexity - Free Credits Offer • AdConnect your repo and Railway handles the rest with instant previews. Quickly provision container image services, databases, and storage volumes.
- In-place Parallel Super Scalar Samplesort (IPS⁴o)☆167Jan 15, 2025Updated last year
- Simple category-based logger generator for C/C++☆10Oct 23, 2016Updated 9 years ago
- ☆39Nov 29, 2021Updated 4 years ago
- Texture Compression Techniques in DuckTales Remastered☆17Jul 11, 2016Updated 9 years ago
- Unstable O(n log n) sorting algorithm with O(n) memory☆71Nov 7, 2025Updated 7 months ago
- Parallel Stable Sort☆15Oct 11, 2015Updated 10 years ago
- Fast integer compression in C using the StreamVByte codec☆416Jun 7, 2026Updated 3 weeks ago
- file system construction kit by Dominic Giampaolo☆12Jun 29, 2015Updated 11 years ago
- A C++ implementation of timsort☆316Dec 3, 2024Updated last year
- Wordpress hosting with auto-scaling - Free Trial Offer • AdFully Managed hosting for WordPress and WooCommerce businesses that need reliable, auto-scalable performance. Cloudways SafeUpdates now available.
- My C libraries☆26Sep 1, 2025Updated 9 months ago
- Sorting routine implementations in "template" C☆475Feb 13, 2024Updated 2 years ago
- Radix sort revisited again☆26Mar 20, 2018Updated 8 years ago
- ☆247Apr 3, 2021Updated 5 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…☆703Oct 9, 2025Updated 8 months ago
- C++ reimplementation of https://github.com/emilk/drop-merge-sort☆21Dec 6, 2021Updated 4 years ago