sebawild / nearly-optimal-mergesort-codeLinks
Code for experiments with nearly optimally adaptive mergesort variants peeksort and powersort
☆13Updated 6 years ago
Alternatives and similar repositories for nearly-optimal-mergesort-code
Users that are interested in nearly-optimal-mergesort-code are comparing it to the libraries listed below
Sorting:
- C++ implementations of Powersort and 4-way Powersort☆19Updated 5 months ago
- Official repository for the official implementation of HyperBitT, HyperBitBit64, and HyperTwoBits☆16Updated 7 months ago
- Encyclopedia of Combinatorial Structures☆14Updated 6 years ago
- String Matching Algorithms Research Tool☆102Updated last year
- HyperLogLogLog: Counting Distinct Elements With One Log More☆18Updated 3 years ago
- A diverse array of heavily refactored versions of Andrey Astrelin's GrailSort.h, aiming to be as readable and intuitive as possible☆48Updated 5 months ago
- A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.☆29Updated 2 years ago
- Bumped Ribbon Retrieval and Approximate Membership Query☆44Updated 3 weeks ago
- A SIMD-based C++ library providing rank/select queries over mutable bitmaps.☆35Updated 2 years ago
- Get control over your imports -- no matter how you run your code☆40Updated 2 weeks ago
- Succinct data structures in C/C++☆88Updated 8 months ago
- Learned Sort: a model-enhanced sorting algorithm☆81Updated 3 years ago
- A collection of tools to analyze student's Python source code☆31Updated 5 months ago
- A tiny approximate K-Nearest Neighbour library in Python based on Fast Product Quantization and IVF☆17Updated 2 years ago
- Noncanonical (but only existing) repo for the pijnu PEG parser☆24Updated 13 years ago
- Waxeye Parser Generator☆19Updated 4 years ago
- ☆28Updated 2 years ago
- Implementation of Gosper's hashlife algorithm☆38Updated 7 months ago
- Jinxed Terminal Library☆9Updated last month
- A fork of Instagram's experimental performance oriented greenfield implementation of Python. It features small objects; a moving GC; hidd…☆44Updated last year
- Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".☆56Updated 2 years ago
- Latex version of “Harry Potter and the Methods of Rationality”☆12Updated 2 years ago
- ☆32Updated last year
- An online tool to disassemble Python code☆36Updated last year
- ☆11Updated 3 years ago
- SUccinct Retrieval Framework☆20Updated 9 years ago
- Generate random critical Galton-Watson trees and display their free trees in a force-directed layout☆14Updated last year
- qp tries and crit-bit tries☆119Updated 2 years ago
- Faster zlib and gzip compatible compression and decompression by providing python bindings for the isa-l library.☆50Updated last week
- Python bindings for the fast integer compression library FastPFor.☆58Updated last year