Algorithms And Data Structures 1-24
23 entries in the Algorithms And Data Structures compendium.
Array (data structure)A linear collection of elements indexed by a mathematical formula.Associative arrayAbstract data type mapping keys to values.B-treeSelf-balancing tree for efficient data storage and retrieval.Bellman–Ford algorithmComputes shortest paths in graphs with negative edge weights.Binary searchEfficient search algorithm for sorted arrays.Binary search treeBinary search tree: ordered binary tree for fast lookup.Bisection methodA simple, robust root-finding method for continuous functions.Breadth-first searchAlgorithm exploring nodes level by level using a queue.Brute-force searchA problem-solving method checking all possible candidates.Cache replacement policiesAlgorithms that decide what to remove from a full cache.Depth-first searchAlgorithm exploring branches fully before backtracking.Dijkstra's algorithmAlgorithm for shortest paths in weighted graphs.Divide-and-conquer algorithmRecursively breaks problems into simpler sub-problems and combines solutions.Dynamic programmingA method simplifying problems by recursive sub-problem breakdown.Euler methodFirst-order numerical method for solving ordinary differential equations.Extended Euclidean algorithmExtension of Euclidean algorithm computing gcd and Bézout coefficients.Greedy algorithmAlgorithm making locally optimal choices without reconsidering past decisions.Heap (data structure)Tree-based data structure satisfying the heap property.QuicksortEfficient divide-and-conquer sorting algorithm developed by Tony Hoare.Fast Fourier transformAlgorithm computing discrete Fourier transforms in O(n log n) time.Finite-state machineA finite-state machine models computation with a finite number of states.Floyd–Warshall algorithmAlgorithm for all-pairs shortest paths in weighted graphs.Ford–Fulkerson algorithmGreedy algorithm for maximum flow in a network.
Browse Algorithms And Data Structures 1-24 in the interactive codex →