Latest Algorithms

zstd
A lossless data compression algorithm
Floyd's cycle-finding
A constant-space cycle finding algorithm.
Counting sort
A non-comparison sorting algorithm that works if the possible elements are a small range of positive integers
Insertion sort
Sorts by sorting one element at a time
Heapsort
Sorts by using a heap

Photo by Nagae / CC BY 2.5
Merge sort
Sorts by dividing into smaller sublists and then merging sublists together
Quicksort
Sort by picking a pivot and partitioning elements into two sides and then repeat recursively.
Sorting
Organizing a collection in an ordered manner

Photo by Gaz1502 / CC BY 3.0
Linear Search
Go through everything to find element
Binary Search
An efficient way to find an element in a sorted list


Latest Data Structures

Merkle tree
A tree used to data verification
Treap
A probabilistic data structure that combines a heap and a binary search tree
Zip Tree
A probabilistic binary search tree
Skip list
A probabilistic collection which combines features of sorted array and a linked list.
Set (BST-based)
A set implementation that uses a binary search tree
Set (Hash-based)
A set implementation that uses a hash table
Graph (Adjacency matrix)
A graph implementation; this is useful for quick adjacency checks.
Graph (Adjacency list)
A graph implementation; this is useful for sparser graphs.
Disjoint-set
Contains non-overlapping sets of elements
Trie
A k-ary search tree used for information retrieval such as autocomplete.
Array
A static indexable collection of elements
Graph
Contains a set of nodes and a set of edges that the nodes point to