rantala / string-sortingLinks
A collection of string sorting algorithms
☆55Updated 4 years ago
Alternatives and similar repositories for string-sorting
Users that are interested in string-sorting are comparing it to the libraries listed below
Sorting:
- Vectorized version of the PCG random number generator☆87Updated 3 weeks ago
- A benchmark of some prominent C/C++ hash table implementations☆104Updated 6 years ago
- An efficient external-memory algorithm for the construction of minimal perfect hash functions☆66Updated last year
- Succinct Data Structure Library☆109Updated 12 years ago
- Fast C functions for the computing the positional popcount (pospopcnt).☆55Updated 6 years ago
- Compact Data Structures Library☆103Updated 3 years ago
- Collection of Parallel String Sorting Algorithms including Parallel Super Scalar String Sample Sort and Parallel Multiway LCP-Mergesort☆33Updated 2 years ago
- Generates benchmark data for two different data structures, then renders some graphs.☆112Updated 6 years ago
- A hash table implementation using Robin Hood Linear Probing☆52Updated 11 years ago
- C library to compute the Hamming weight of arrays☆51Updated 7 years ago
- Fast generalized heap tree algorithms in C++ and C. Provides simultaneous support for D-heap and B-heap.☆136Updated 6 years ago
- Radix sort implemented i Java and C/C++ with benchmark.☆41Updated 14 years ago
- A fast implementation for varbyte 32bit/64bit integer compression☆121Updated 8 years ago
- Fast C header-only library for popcnt, pospopcnt, and set algebraic operations☆45Updated 6 years ago
- A fast and memory efficient hashmap using sorting to resolve collisions☆43Updated 5 years ago
- A benchmark for sorting algorithms☆63Updated 4 years ago
- Experiments with array layouts for comparison-based searching☆86Updated 2 years ago
- Intel(R) Concurrent Collections for C++☆116Updated 3 years ago
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆55Updated 2 years ago
- Highly optimized implementation of tiered vectors, a data structure for maintaining a sequence of n elements supporting access in time O(…☆50Updated last year
- Linear vs binary search benchmark☆41Updated 6 years ago
- a minimal C++ interval tree implementation☆237Updated 4 years ago
- A simple bitset library in C☆144Updated 2 weeks ago
- FOundation of stXXl and thriLL☆14Updated 2 years ago
- Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".☆57Updated 3 years ago
- Rolling Hash C++ Library☆190Updated last year
- Hash Array Mapped Trie (C++ Templates)☆125Updated 2 years ago
- A C++ library for integer array compression☆30Updated 3 years ago
- Memory-mapped storage library☆76Updated 9 years ago
- Fast decoder for VByte-compressed integers☆126Updated 2 months ago