shorthashd
A string hashing utility based on Daniel J. Bernstein's popular 'times 33' hash algorithm.
A string hashing utility based on Daniel J. Bernstein's popular 'times 33' hash algorithm.
Powerful TypeScript/JavaScript library to simplify paths or surfaces between 2 and N dimensions efficiently.
Simple binary search algorithm implementation
A simple binary search tree
Simple bubble sort algorithm implementation
a comprehensive implementation of the GnoSort sorting algorithm invented by CtrlCreep (https://twitter.com/ctrlcreep/status/1566073798188826624).
Browserify module of Conway's Game of Life passing only an array, size and steps, returns array with marked objects
All basic to advanced utilities function
Giselle cipher, is a symetric key cipher, based on the XOR, base conversion, Scrypt & One Time Pad algorithm.
A true O(1) sorting algorithm!
Group similar items together.
Generate and print diverse patterns, from square stars to intricate Pascal triangles, with this JavaScript npm package. Simplify pattern creation for educational, interview, or decorative purposes in your applications
This is the CLI version for Ilse Langnar's Notebook. It's an implementatino of a standard where you can have the same notes, files and overall organization into the same structure as to access them in different "environments". Such as desktop, mobile, com
International Data Encryption Algorithm js implementation
Interactive Protein Sequence VIsualization/Viewer - Interactive Circos
Merge Sort algorithm implementation without recursion, using cached binary trees
Guess the indentation of a JSON string
An algorithm to calculate rarity of NFT(how special it is), based on Jaccard Distance.
Hashing strings and compare string hashes with various algorithms is simple and easy
A lightweight HNSW implementation for nearest neighbor search.