Wolfsort is a stable adaptive hybrid radix / merge sort.
☆199Jul 27, 2024Updated last year
Alternatives and similar repositories for wolfsort
Users that are interested in wolfsort are comparing it to the libraries listed below
Sorting:
- Blitsort is an in-place stable adaptive rotate mergesort / quicksort.☆715Jul 27, 2024Updated last year
- A collection of improved binary search algorithms.☆680Jun 20, 2025Updated 8 months ago
- Quadsort is a branchless stable adaptive mergesort faster than quicksort.☆2,207Jul 27, 2024Updated last year
- Non-preemptive Thread Hierarchy Manager☆56Oct 26, 2024Updated last year
- A fast branchless stable quicksort / mergesort hybrid that is highly adaptive.☆733Jul 27, 2024Updated last year
- A stable adaptive partitioning comparison sort.☆209Jul 27, 2024Updated last year
- A fast and memory efficient hashmap using sorting to resolve collisions☆43Nov 16, 2020Updated 5 years ago
- A minimal stack-based VM☆182Sep 10, 2020Updated 5 years ago
- A library for building an in-memory, Adaptive Learned indEX☆698Mar 12, 2024Updated last year
- Lower Size Bounds for Sorting Networks☆46Dec 9, 2020Updated 5 years ago
- UMASH: a fast enough hash and fingerprint with collision bounds☆160Jan 11, 2026Updated last month
- Linux system calls.☆217Nov 18, 2019Updated 6 years ago
- The Minimal LZMA (minlzma) project aims to provide a minimalistic, cross-platform, highly commented, standards-compliant C library (minlz…☆366Jan 13, 2022Updated 4 years ago
- Base252 is a binary to C string encoding scheme with flexible escaping.☆23Jul 20, 2020Updated 5 years ago
- Quick sort code using AVX2 instructions☆69Jun 5, 2017Updated 8 years ago
- A versioning data store for time-variant graph data.☆344Aug 13, 2024Updated last year
- file history with ed(1), diff(1), awk(1), sed(1) and sh(1)☆109Jun 21, 2020Updated 5 years ago
- unfork(2) is the inverse of fork(2). sort of.☆1,485Apr 21, 2024Updated last year
- A text-mode e-mail client☆38Apr 25, 2024Updated last year
- fundamental tools in the spirit of C☆58Jan 23, 2020Updated 6 years ago
- This repository contains high-performance implementations of memset and memcpy in assembly.☆341Jan 10, 2022Updated 4 years ago
- ☆332Sep 16, 2019Updated 6 years ago
- Example of CRUSH compression with optimal parsing using BriefLZ algorithms☆16Nov 1, 2023Updated 2 years ago
- In-place Parallel Super Scalar Samplesort (IPS⁴o)☆133Jan 15, 2025Updated last year
- ☆335Sep 15, 2019Updated 6 years ago
- Fast Approximate Membership Filters (C++)☆24Apr 27, 2021Updated 4 years ago
- DISCoHAsH - Simple, fast, quality hash in 120 lines. 10GB/s serial (depending on hardware). Also in NodeJS☆219Jul 9, 2023Updated 2 years ago
- ☆39Jun 20, 2020Updated 5 years ago
- Stackful Async Subroutines for C. Brings async 2 C☆92Jul 15, 2021Updated 4 years ago
- A digital logic simulation written in C☆63Jul 5, 2020Updated 5 years ago
- The FASTEST QUALITY hash function, random number generators (PRNG) and hash map.☆1,095Jun 7, 2024Updated last year
- Fast Static Symbol Table (FSST): efficient random-access string compression☆499Nov 26, 2025Updated 3 months ago
- A generator for OpenAPI 3☆97Oct 23, 2020Updated 5 years ago
- The Amsterdam Compiler Kit☆27Mar 30, 2025Updated 11 months ago
- DEFER macros in C☆13Jul 14, 2024Updated last year
- Go syntax implementation in python.☆55Jan 26, 2020Updated 6 years ago
- PoWx mission: Aiming at smaller energy per hash hardware.☆11Dec 18, 2021Updated 4 years ago
- QOI image decoding and encoding for SDL2 in C99☆12Dec 21, 2021Updated 4 years ago
- Example layout for a package using Go assembly.☆12Aug 18, 2016Updated 9 years ago