porro
Fast leaky bucket algorithm implementation without timers
Fast leaky bucket algorithm implementation without timers
integer factorization using Pollard's rho algorithm with Brent cycle detection, Miller–Rabin primality test
A lightning-fast implementation of the Levenshtein distance algorithm. Written in AssemblyScript, compiled to WebAssembly, and optimized for speed.
algorithm
Lightning-fast median finding with O(n) average time complexity using Floyd-Rivest algorithm
Just the cutest and tiniest queue/deque implementation!
The most efficient JS implementation calculating the Levenshtein distance, i.e. the difference between two strings.
Comprehensive pathfinding library for grid based games
Checks if a number is prime or not
The world's most honest sorting method: swaps elements slowly, checks Twitter constantly, and finishes eventually. Not not prod-safe
The official TypeScript implementation of the RANDEVU algorithm
Rapid Asymmetric Maximum (RAM) is a high throughput, hash-less, byte shift-resistant content-defined chunking algorithm for data deduplication.
A package providing binary search functionality
Queue data structure
QuantumMatcher library is a fuzzy matching algorithm that leverages bitwise operations to efficiently find approximate matches within a collection of items.
Rankr helps you score data sets based on multiple criterias.
An npm package for managing SHA-(512,256,1,etc.).
Generate & Validate Singapore NRIC (National Registration Identity Card) Numbers
Shual is a fibonacci based cryptography toolset.
A new algorithm for retrieving topological skeleton as a set of polylines from binary images