Locality sensitive hashing (LSH) is a widely popular technique used in approximate nearest neighbor (ANN) search. The solution to efficient similarity search is a profitable one — it is at the core of several billion (and even trillion) dollar companies.

Locality sensitive hashing (LSH) is a widely popular technique used in approximate nearest neighbor (ANN) search. The solution to efficient similarity search is a profitable one — it is at the core of several billion (and even trillion) dollar companies.

Definitions of algorithms, data structures, and classical Computer Science problems.Some entries have links to implementations and more information.

z0ro Repository - Powered by z0ro

VisuAlgo was conceptualised in 2011 by Associate Professor Steven Halim (NUS School of Computing) as a tool to help his students better understand data structures and algorithms, by allowing them to learn the basics on their own and at their own pace. Together with his students from the National University of Singapore, a series of visualizations were developed and consolidated, from simple sorting algorithms to complex graph data structures. Though specifically designed for the use of NUS students taking various data structure and algorithm classes (CS1010/equivalent, CS2040/equivalent (inclusive of IT5003)), CS3230, CS3233, and CS4234), as advocators of online learning, we hope that curious minds around the world will find these visualizations useful as well.

See also https://news.ycombinator.com/item?id=47311815

Algorithm X is an algorithm for solving the exact cover problem. It is a straightforward recursive, nondeterministic, depth-first, backtracking algorithm used by Donald Knuth to demonstrate an efficient implementation called DLX, which uses the dancing links technique.

Open source resource for learning algorithms and their implementation in any programming language

Mentions differences between Luma/luminance and how to compute the correct values

Rendezvous hashing is an algorithm to solve the distributed hash table problem - a common and general pattern in distributed systems

A really smart ant overall simple checksum that works on unordered collections

A really smart ant overall simple checksum that works on unordered collections

Some simple hash functions including a reversible one.

Another algorithm to generate legible ids.

Now a classic, shows some really smart fractional index tricks to efficiently do collaborative editing on trees. Applies to many apps with structured data!