[{"n": "Array (data structure)", "u": "/e/algorithms-and-data-structures/array-data-structure/", "s": "A mutable, linear collection of elements of the same data type, with positions computed from indices."}, {"n": "Associative array", "u": "/e/algorithms-and-data-structures/associative-array/", "s": "Abstract data type mapping keys to values."}, {"n": "B-tree", "u": "/e/algorithms-and-data-structures/b-tree/", "s": "Self-balancing tree for efficient data storage and retrieval."}, {"n": "Bellman–Ford algorithm", "u": "/e/algorithms-and-data-structures/bellman-ford-algorithm/", "s": "Computes shortest paths in graphs with negative edge weights."}, {"n": "Binary search", "u": "/e/algorithms-and-data-structures/binary-search/", "s": "Efficient search algorithm for sorted arrays."}, {"n": "Binary search tree", "u": "/e/algorithms-and-data-structures/binary-search-tree/", "s": "Binary search tree: ordered binary tree for fast lookup."}, {"n": "Bisection method", "u": "/e/algorithms-and-data-structures/bisection-method/", "s": "A simple, robust root-finding method for continuous functions."}, {"n": "Breadth-first search", "u": "/e/algorithms-and-data-structures/breadth-first-search/", "s": "Algorithm exploring nodes level by level using a queue."}, {"n": "Brute-force search", "u": "/e/algorithms-and-data-structures/brute-force-search/", "s": "A problem-solving method checking all possible candidates."}, {"n": "Cache replacement policies", "u": "/e/algorithms-and-data-structures/cache-replacement-policies/", "s": "Algorithms that decide what to remove from a full cache."}, {"n": "Depth-first search", "u": "/e/algorithms-and-data-structures/depth-first-search/", "s": "Algorithm exploring branches fully before backtracking."}, {"n": "Dijkstra's algorithm", "u": "/e/algorithms-and-data-structures/dijkstra-s-algorithm/", "s": "Algorithm for shortest paths in weighted graphs."}, {"n": "Divide-and-conquer algorithm", "u": "/e/algorithms-and-data-structures/divide-and-conquer-algorithm/", "s": "Recursively breaks problems into simpler sub-problems and combines solutions."}, {"n": "Dynamic programming", "u": "/e/algorithms-and-data-structures/dynamic-programming/", "s": "A method simplifying problems by recursive sub-problem breakdown."}, {"n": "Euler method", "u": "/e/algorithms-and-data-structures/euler-method/", "s": "First-order numerical method for solving ordinary differential equations."}, {"n": "Extended Euclidean algorithm", "u": "/e/algorithms-and-data-structures/extended-euclidean-algorithm/", "s": "Extension of Euclidean algorithm computing gcd and Bézout coefficients."}, {"n": "Greedy algorithm", "u": "/e/algorithms-and-data-structures/greedy-algorithm/", "s": "Algorithm making locally optimal choices without reconsidering past decisions."}, {"n": "Heap (data structure)", "u": "/e/algorithms-and-data-structures/heap-data-structure/", "s": "Tree-based data structure satisfying the heap property."}, {"n": "Quicksort", "u": "/e/algorithms-and-data-structures/quicksort/", "s": "Efficient divide-and-conquer sorting algorithm developed by Tony Hoare."}, {"n": "Fast Fourier transform", "u": "/e/algorithms-and-data-structures/fast-fourier-transform/", "s": "Algorithm computing discrete Fourier transforms in O(n log n) time."}, {"n": "Finite-state machine", "u": "/e/algorithms-and-data-structures/finite-state-machine/", "s": "A finite-state machine models computation with a finite number of states."}, {"n": "Floyd–Warshall algorithm", "u": "/e/algorithms-and-data-structures/floyd-warshall-algorithm/", "s": "Algorithm for all-pairs shortest paths in weighted graphs."}, {"n": "Ford–Fulkerson algorithm", "u": "/e/algorithms-and-data-structures/ford-fulkerson-algorithm/", "s": "Greedy algorithm for maximum flow in a network."}, {"n": "Gale–Shapley algorithm", "u": "/e/algorithms-and-data-structures/gale-shapley-algorithm/", "s": "Algorithm for stable matching, used in medical residency matching."}, {"n": "Gradient descent", "u": "/e/algorithms-and-data-structures/gradient-descent/", "s": "First-order iterative algorithm for minimizing differentiable multivariate functions."}, {"n": "Graph (abstract data type)", "u": "/e/algorithms-and-data-structures/graph-abstract-data-type/", "s": "Abstract data type implementing graph theory concepts."}, {"n": "Hash table", "u": "/e/algorithms-and-data-structures/hash-table/", "s": "A data structure mapping keys to values via hash functions."}, {"n": "Heapsort", "u": "/e/algorithms-and-data-structures/heapsort/", "s": "Efficient comparison-based sorting using a binary heap."}, {"n": "Held–Karp algorithm", "u": "/e/algorithms-and-data-structures/held-karp-algorithm/", "s": "Dynamic programming algorithm for exact TSP solution."}, {"n": "Hungarian algorithm", "u": "/e/algorithms-and-data-structures/hungarian-algorithm/", "s": "Polynomial-time algorithm for the assignment problem."}, {"n": "Kruskal's algorithm", "u": "/e/algorithms-and-data-structures/kruskal-s-algorithm/", "s": "Greedy algorithm for minimum spanning trees using sorted edges."}, {"n": "Linked list", "u": "/e/algorithms-and-data-structures/linked-list/", "s": "A data structure where each node points to the next."}, {"n": "Merge sort", "u": "/e/algorithms-and-data-structures/merge-sort/", "s": "A stable, divide-and-conquer sorting algorithm invented by John von Neumann."}, {"n": "Maximum flow problem", "u": "/e/algorithms-and-data-structures/maximum-flow-problem/", "s": "Problem of maximizing flow through a network from source to sink."}, {"n": "Minimum-cost flow problem", "u": "/e/algorithms-and-data-structures/minimum-cost-flow-problem/", "s": "Optimization problem to send flow at minimum cost."}, {"n": "Max-flow min-cut theorem", "u": "/e/algorithms-and-data-structures/max-flow-min-cut-theorem/", "s": "Maximum flow equals minimum cut capacity in a network."}, {"n": "Maximum-cardinality matching", "u": "/e/algorithms-and-data-structures/maximum-cardinality-matching/", "s": "A matching with the largest possible number of edges in a graph."}]