common subsequence height height-balanced binary search tree height-balanced tree heuristic hidden Markov model highest common factor Hilbert curve histogram sort homeomorphic horizontal visibility map Huffman encoding Hungarian algorithm hybrid algorithm hyperedge hypergraph I Identity function ideal merge implication implies implicit data structure in-branching inclusion–exclusion principle inclusive or incompressible string incremental algorithm in-degree independent set (graph theory) index file information theoretic bound in-place algorithm in-order traversal in-place sort insertion sort instantaneous description integer linear program integer multi-commodity flow integer polyhedron interactive proof system interface interior-based representation internal node internal sort interpolation search interpolation-sequential search interpolation sort intersection (set theory) interval tree intractable introsort introspective sort inverse Ackermann function inverted file index inverted index irreflexive isomorphic iteration J Jaro–Winkler distance Johnson's algorithm Johnson–Trotter algorithm jump list jump search K Karmarkar's algorithm Karnaugh map Karp–Rabin string-search algorithm Karp reduction k-ary heap k-ary Huffman encoding k-ary tree k-clustering k-coloring k-connected graph k-d-B-tree (not to be confused with bdk tree) k-dimensional K-dominant match k-d tree key KMP KmpSkip Search knapsack problem knight's tour Knuth–Morris–Pratt algorithm Königsberg bridges problem Kolmogorov complexity Kraft's inequality Kripke structure Kruskal's algorithm kth order Fibonacci numbers kth shortest path kth smallest element KV diagram k-way merge k-way merge sort k-way tree L labeled graph language last-in, first-out (LIFO) Las Vegas algorithm lattice (group) layered graph LCS leaf least common multiple (LCM) leftist tree left rotation left-child right-sibling binary tree also termed first-child next-sibling binary tree, doubly chained tree, or filial-heir chain Lempel–Ziv–Welch (LZW) level-order traversal Levenshtein distance lexicographical order linear linear congruential generator linear hash linear insertion sort linear order linear probing linear probing sort linear product linear program linear quadtree linear search link linked list list list contraction little-o notation Lm distance load factor (computer science) local alignment local optimum logarithm, logarithmic scale longest common subsequence longest common substring Lotka's law lower bound lower triangular matrix lowest common ancestor l-reduction M Malhotra–Kumar–Maheshwari blocking flow (ru.) Manhattan distance many-one reduction Markov chain marriage problem (see assignment problem) Master theorem (analysis of algorithms) matched edge matched vertex matching (graph theory) matrix matrix-chain multiplication problem max-heap property maximal independent set maximally connected component Maximal Shift maximum bipartite matching maximum-flow problem MAX-SNP Mealy machine mean median meld (data structures) memoization merge algorithm merge sort Merkle tree meromorphic function metaheuristic metaphone midrange Miller–Rabin primality test min-heap property minimal perfect hashing minimum bounding box (MBB) minimum cut minimum path cover minimum spanning tree minimum vertex cut