List of terms relating to algorithms and data structures
The NIST Dictionary of Algorithms and Data Structures is a reference work maintained by the U.S. National Institute of Standards and Technology. It defines a large number of terms relating to algorithms and data structures. For algorithms and data structures not necessarily mentioned here, see list of algorithms and list of data structures. This list of terms was originally derived from the index of that document, and is in the public domain, as it was compiled by a Federal Government employee as part of a Federal Government work. Some of the terms defined are:
- Comment
- enThe NIST Dictionary of Algorithms and Data Structures is a reference work maintained by the U.S. National Institute of Standards and Technology. It defines a large number of terms relating to algorithms and data structures. For algorithms and data structures not necessarily mentioned here, see list of algorithms and list of data structures. This list of terms was originally derived from the index of that document, and is in the public domain, as it was compiled by a Federal Government employee as part of a Federal Government work. Some of the terms defined are:
- Date
- enSeptember 2018
- Has abstract
- enThe NIST Dictionary of Algorithms and Data Structures is a reference work maintained by the U.S. National Institute of Standards and Technology. It defines a large number of terms relating to algorithms and data structures. For algorithms and data structures not necessarily mentioned here, see list of algorithms and list of data structures. This list of terms was originally derived from the index of that document, and is in the public domain, as it was compiled by a Federal Government employee as part of a Federal Government work. Some of the terms defined are:
- Hypernym
- Work
- Is primary topic of
- List of terms relating to algorithms and data structures
- Label
- enList of terms relating to algorithms and data structures
- Link from a Wikipage to an external page
- zabrodskyvlada.byethost10.com/3alg.html
- Link from a Wikipage to another Wikipage
- (a,b)-tree
- 0-ary function
- 0-based indexing
- 1 knapsack problem
- 2–3–4 tree
- 2–3 tree
- 8 queens
- A* search algorithm
- Absolute performance guarantee
- Abstract data type
- Accepting state
- Ackermann's function
- Active data structure
- Acyclic directed graph
- Adaptive heap sort
- Adaptive Huffman coding
- Adaptive k-d tree
- Adaptive sort
- Address-calculation sort
- Adjacency list
- Adjacency matrix
- Adversary model
- Algorithm
- Algorithm BSTW
- Algorithmic efficiency
- Algorithm V
- All pairs shortest path
- Alphabet (formal languages)
- Alpha Skip Search algorithm
- Alternating path
- Alternating Turing machine
- Alternation (complexity)
- American flag sort
- American National Standards Institute
- Amortized cost
- Ancestor
- Antichain
- Antisymmetric relation
- Apostolico–Crochemore
- Apostolico–Giancarlo algorithm
- Approximate string matching
- Approximation algorithm
- Arborescence (graph theory)
- Arithmetic coding
- Arithmetic progression
- Array data structure
- Array index
- Array merging
- Array search
- Articulation point
- Assignment problem
- Association list
- Associative
- Associative array
- Asymptotic computational complexity
- Augmenting path
- Automata theory
- AVL tree
- Axiomatic semantics
- B*-tree
- B+ tree
- Backtracking
- Baillie–PSW primality test
- Balanced binary tree
- Balanced k-way merge sort
- Balanced merge sort
- Balanced multiway merge
- Balanced multiway tree
- Balanced quicksort
- Balanced two-way merge sort
- BANG file
- Batcher sort
- Baum Welch algorithm
- BB alpha tree
- Bdk tree
- BD-tree
- Bellman–Ford algorithm
- Benford's law
- Best, worst and average case
- Best-first search
- Biconnected component
- Biconnected graph
- Bidirectional bubble sort
- Big O notation
- Big-O notation
- Binary decision diagram
- Binary function
- Binary GCD algorithm
- Binary heap
- Binary insertion sort
- Binary knapsack problem
- Binary priority queue
- Binary relation
- Binary search
- Binary search tree
- Binary tree
- Binary tree representation of trees
- Bingo sort
- Binomial heap
- Binomial tree
- Bin packing problem
- Bin sort
- Bipartite graph
- Bipartite matching
- Bisection method
- Bitonic sort
- Bit vector
- Bk tree
- Block (programming)
- Block addressing index
- Blocking flow
- Block search
- Bloom filter
- Blossom (graph theory)
- Bogosort
- Boogol
- Boolean datatype
- Boolean expression
- Boolean function
- Bottleneck traveling salesman
- Bottom-up tree automaton
- Boundary-based representation
- Bounded error probability in polynomial time
- Bounded queue
- Bounded stack
- Bounding volume hierarchy
- Boyer–Moore–Horspool algorithm
- Boyer–Moore string-search algorithm
- Bozo sort
- BPP (complexity)
- Bradford's law
- Branch (computer science)
- Branch and bound
- Branching (software)
- Breadth-first search
- Bresenham's line algorithm
- Brick sort
- Bridge (graph theory)
- British Museum algorithm
- Brute-force attack
- Brute-force search
- Brute-force string search
- Brute force string search with mismatches
- BSP-tree
- B-tree
- Bubble sort
- Bucket (computing)
- Bucket array
- Bucketing method
- Bucket sort
- Bucket trie
- Buddy memory allocation
- Buddy tree
- Build-heap
- Burrows–Wheeler transform
- Busy beaver
- Byzantine generals
- Cactus stack
- Calculus of Communicating Systems
- Calendar queue
- Candidate consistency testing
- Candidate verification
- Canonical complexity class
- Capacitated facility location
- Capacity constraint
- Cartesian tree
- Cascade merge sort
- Category:Algorithms and data structures
- Category:Lists of computer terms
- Category:Mathematics-related lists
- Caverphone
- Cayley–Purser algorithm
- C curve
- Cell probe model
- Cell tree
- Cellular automaton
- Centroid
- Chain (order theory)
- Chaining (algorithm)
- Child node
- Chinese postman problem
- Chinese remainder theorem
- Christofides algorithm
- Christofides heuristic
- Chromatic index
- Chromatic number
- Church–Turing thesis
- Circuit complexity
- Circuit value problem
- Circular list
- Circular queue
- Clique (graph theory)
- Clique problem
- Clustering free
- Coalesced hashing
- Coarsening
- Cocktail shaker sort
- Codeword
- Coding tree
- Collective recursion
- Collision resolution scheme
- Colussi
- Combination
- Comb sort
- Communicating sequential processes
- Communicating Sequential Processes
- Commutative
- Compact DAWG
- Compact trie
- Comparison sort
- Competitive analysis (online algorithm)
- Competitive ratio
- Complement (set theory)
- Complete binary tree
- Complete graph
- Completely connected graph
- Complete tree
- Complexity
- Complexity class
- Computable
- Computational tree logic
- Computer configuration
- Computer keyboard keys
- Concave function
- Concurrent flow
- Concurrent read, concurrent write
- Concurrent read, exclusive write
- Confluently persistent data structure
- Connected component (graph theory)
- Connected graph
- Co-NP
- Constant function
- Constraint satisfaction problem
- Continuous knapsack problem
- Cook's theorem
- Cook reduction
- Counting sort
- Cover (set theory)
- CRCW
- Crew (algorithm)
- Critical path problem
- Cuckoo hashing
- Cut (graph theory)
- Cut (logic programming)
- Cutting plane
- Cutting stock problem
- Cutting theorem
- Cut vertex
- Cycle sort
- Cyclic redundancy check
- D-adjacent
- DAG shortest paths
- Damerau–Levenshtein distance
- Data domain
- Data structure
- Decidability (logic)
- Decidable language
- Decimation (signal processing)
- Decision problem
- Decision tree
- Decomposable searching problem
- Degree (disambiguation)
- Dense graph
- Depoissonization
- Depth-first search
- Depth-limited search
- Deque
- Derangement
- Deterministic algorithm
- Deterministic finite automata string search
- Deterministic finite automaton
- Deterministic finite state machine
- Deterministic finite tree automaton
- Deterministic pushdown automaton
- Deterministic tree automaton
- Deutsch–Jozsa algorithm
- DFS forest
- DFTA
- Diagonalization argument
- Diameter
- Dichotomic search
- Dictionary (data structure)
- Difference (set theory)
- Digital circuit
- Digital search tree
- Digital tree
- Dijkstra's algorithm
- Diminishing increment sort
- Dining philosophers
- Direct chaining hashing
- Directed acyclic graph
- Directed acyclic word graph (disambiguation)
- Directed graph
- Discrete Fourier transform
- Discrete interval encoding tree
- Discrete p-center
- Disjoint set
- Disjunction
- Distributed algorithm
- Distributional complexity
- Distribution sort
- Divide-and-conquer algorithm
- Divide and marriage before conquest
- Division method
- Don't-care term
- Doomsday rule
- Double-direction bubble sort
- Double-ended priority queue
- Double-ended queue
- Double hashing
- Double left rotation
- Double Metaphone
- Double right rotation
- Doubly linked list
- Dragon curve
- Dual graph
- Dual linear program
- Dyadic tree
- Dynamic array
- Dynamic data structure
- Dynamic hashing
- Dynamic programming
- Dynamization transformation
- Eb tree
- Edge coloring
- Edge connectivity
- Edge crossing
- Edge-weighted graph
- Edit distance
- Edit operation
- Edit script
- Elastic-bucket trie
- Element uniqueness
- End-of-string
- Epidemic algorithm
- Euclid's algorithm
- Euclidean algorithm
- Euclidean distance
- Euclidean Steiner tree
- Euclidean traveling salesman problem
- Euler cycle
- Eulerian graph
- Eulerian path
- Exact string matching
- Exchange sort
- Exclusive or
- Exclusive read, concurrent write
- Exclusive read, exclusive write
- Exhaustive search
- Existential state
- Expandable hashing
- Expander graph
- Exponential (disambiguation)
- Extended binary tree
- Extended Euclidean algorithm
- Extended k-d tree
- Extendible cell
- Extendible hashing
- External index
- External memory algorithm
- External memory data structure
- External merge
- External merge sort
- External node
- External quicksort
- External radix sort
- External sort
- Extrapolation search
- Extremal
- Extreme point
- Facility location
- Factorial
- Fast fourier transform
- Fathoming
- Feasible region
- Feasible solution
- Feedback edge set
- Feedback vertex set
- Ferguson–Forcade algorithm
- Fibonacci heap
- Fibonacci number
- Fibonacci search
- Fibonacci tree
- FIFO (computing and electronics)
- Find (Unix)
- Find kth least element
- Finitary tree
- Finite state automaton
- Finite-state machine
- Finite state machine minimization
- Finite-state transducer
- First come, first served
- Fixed-grid method
- Flash sort
- Flow (mathematics)
- Flow conservation
- Flow function
- Flow network
- Floyd–Warshall algorithm
- Ford–Fulkerson algorithm
- Forest (graph theory)
- Forest editing problem
- Formal language
- Formal methods
- Formal verification
- Forward index
- Fractal
- Fractional knapsack problem
- Fractional solution
- Free edge
- Free list
- Free tree
- Free vertex
- Frequency count heuristic
- Full array
- Full binary tree
- Full inverted index
- Fully dynamic graph problem
- Fully persistent data structure
- Fully polynomial approximation scheme
- Function (mathematics)
- Function (programming)
- Functional data structure
- Galil–Giancarlo
- Galil–Seiferas
- Gamma function
- GBD-tree
- Geometric optimization problem
- Global optimum
- Glossary of graph theory
- Gnome sort
- Goobi
- Graph (data structure)
- Graph coloring
- Graph concentration
- Graph drawing
- Graph isomorphism
- Graph partition
- Gray code
- Greatest common divisor
- Greedy algorithm
- Greedy heuristic
- Grid drawing
- Grid file
- Grover's algorithm
- Halting problem
- Hamiltonian cycle
- Hamiltonian path
- Hamming distance
- Hash collision
- Hash function
- Hash heap
- Hash table
- Hash table delete
- Hausdorff distance
- HB-tree
- Heap (data structure)
- Heapify
- Heap property
- Heapsort
- Heaviest 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
- Ideal merge
- Identity function
- Implies operator
- In-branching
- Inclusion–exclusion principle
- Inclusive or
- Incompressible string
- Incremental algorithm
- In-degree
- Independent set (graph theory)
- Indeterminacy in computation (disambiguation)
- Index file
- Information theoretic bound
- In-order traversal
- In-place algorithm
- Insertion sort
- Instantaneous description
- Integer linear program
- Integer multi-commodity flow
- Integer polyhedron
- Interactive proof system
- Interface (computing)
- Interior-based representation
- Internal node
- Internal sort
- Internet Security Association and Key Management Protocol
- Interpolation search
- Interpolation-sequential search
- Interpolation sort
- Intersection (set theory)
- Interval tree
- Intractability (complexity)
- Introsort
- Introspective sort
- Inverse Ackermann function
- Inverted file index
- Inverted index
- Irreflexive
- Isomorphic
- Iteration
- Jaro–Winkler distance
- Johnson's algorithm
- Jump search
- Karmarkar's algorithm
- Karnaugh map
- Karp reduction
- K-ary heap
- K-ary Huffman encoding
- K-ary tree
- K-clustering
- K-coloring
- K-connected graph
- K-D-B-tree
- K-dimensional
- K-dominant match
- K-d tree
- KmpSkip Search
- Knapsack problem
- Knight's tour
- Knuth–Morris–Pratt algorithm
- 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
- Labeled graph
- Laboratory for Computer Science
- Language
- Las Vegas algorithm
- Lattice (group)
- Layered graph
- Leaf
- Leaf node
- Least common multiple
- Left-child right-sibling binary tree
- Leftist tree
- Left rotation
- Lempel–Ziv–Welch
- Level-order traversal
- Levenshtein distance
- Lexicographical order
- LIFO (computing)
- Linear
- Linear congruential generator
- Linear hash
- Linear insertion sort
- Linear order
- Linear probing
- Linear probing sort
- Linear product
- Linear program
- Linear quadtree
- Linear search
- Linked list
- List (computing)
- List contraction
- List of algorithms
- List of data structures
- Little-o notation
- Lm distance
- Load factor (computer science)
- Local alignment
- Local optimum
- Logarithm
- Logarithmic scale
- Logical conjunction
- Logical disjunction
- Logical nand
- Logical nor
- Longest common subsequence
- Longest common substring
- Loop (graph theory)
- Lotka's law
- Lower bound
- Lower triangular matrix
- Lowest common ancestor
- L-reduction
- Malhotra–Kumar–Maheshwari blocking flow
- Manhattan distance
- Many-one reduction
- Markov chain
- Master theorem (analysis of algorithms)
- Matched edge
- Matched vertex
- Matching (graph theory)
- Material conditional
- Matrix (mathematics)
- 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)
- Membership function (mathematics)
- Memoization
- Memory segment
- Merge algorithm
- Merge sort
- Merkle tree
- Meromorphic function
- Metaheuristic
- Metaphone
- Midrange
- Miller–Rabin primality test
- Min-heap property
- Minimal perfect hashing
- Minimum bounding box
- Minimum cut
- Minimum path cover
- Minimum spanning tree
- Minimum vertex cut
- Mixed integer linear program
- Mode (statistics)
- Model checking
- Model of computation
- Moderately exponential
- Monotone priority queue
- Monotonically decreasing
- Monotonically increasing
- Monte Carlo algorithm
- Moore machine
- Morris–Pratt
- Move-to-front heuristic
- Move-to-root heuristic
- Multi-commodity flow
- Multigraph
- Multilayer grid file
- Multiplication method
- Multiprefix
- Multiprocessor model
- Multiset
- Multi suffix tree
- Multiway decision
- Multiway merge
- Multiway search tree
- Multiway tree
- Munkres' assignment algorithm
- Naive string search
- N-ary function
- National Institute of Standards and Technology
- NC (complexity)
- NC many-one reducibility
- Nearest neighbor search
- Negation
- Network flow problem
- New York State Identification and Intelligence System
- Next state
- NIST
- Node (computer science)
- Nonbalanced merge
- Nonbalanced merge sort
- Nondeterministic algorithm
- Nondeterministic finite automaton
- Nondeterministic finite-state machine
- Nondeterministic finite tree automaton
- Nondeterministic Turing machine
- Nonterminal node
- Not So Naive
- NP (complexity)
- NP-complete
- NP-complete language
- NP-hard
- N queens
- Nullary function
- Null tree
- Numerical stability
- Obershelp pattern recognition
- Objective function
- Occurrence (type–token distinction)
- Octree
- Odd–even sort
- Offline algorithm
- Offset (computer science)
- Omega
- Omicron
- One-based indexing
- One-dimensional
- Online algorithm
- Open addressing
- Optimal cost
- Optimal hashing
- Optimal merge
- Optimal mismatch
- Optimal polygon triangulation problem
- Optimal polyphase merge
- Optimal polyphase merge sort
- Optimal solution
- Optimal triangulation problem
- Optimal value
- Optimization (mathematics)
- Oracle set
- Oracle tape
- Oracle Turing machine
- Ordered array
- Ordered binary decision diagram
- Ordered linked list
- Ordered tree
- Order preserving hash
- Order preserving minimal perfect hashing
- Orders of approximation
- Oriented acyclic graph
- Oriented graph
- Oriented tree
- Orthogonal drawing
- Orthogonal lists
- Orthogonally convex rectilinear polygon
- Oscillating merge sort
- Out-branching
- Out-degree
- Overlapping subproblems
- Padding argument
- Pagoda (data structure)
- Pairing heap
- Parallel computation thesis
- Parallel prefix computation
- Parallel random-access machine
- Parametric searching
- Parent
- Partial function
- Partially decidable problem
- Partially dynamic graph problem
- Partially ordered set
- Partially persistent data structure
- Partial order
- Partial recursive function
- Partition (set theory)
- Passive data structure
- Path (graph theory)
- Path cover
- Path system problem
- Patience sorting
- Patricia tree
- Pattern
- Pattern element
- P-complete
- Peano curve
- Pearson's hashing
- Perfect binary tree
- Perfect hashing
- Perfect k-ary tree
- Perfect matching
- Performance guarantee
- Performance ratio
- Permutation
- Persistent data structure
- Phencyclidine
- Phonetic coding
- Pile (data structure)
- Pipelined divide and conquer
- Planar graph
- Planarization
- Planar separator theorem
- Planar straight-line graph
- PLOP-hashing
- Point access method
- Pointer jumping
- Pointer machine
- Poissonization
- Polychotomy
- Polyhedron
- Polylogarithmic
- Polynomial
- Polynomial hierarchy
- Polynomial time
- Polynomial-time approximation scheme
- Polynomial-time reduction
- Polyphase merge
- Polyphase merge sort
- Polytope
- Poset
- Post correspondence problem
- Postfix traversal
- Postman's sort
- Postorder traversal
- Post–Turing machine
- Potential method
- Predicate (computer programming)
- Prefix (computer science)
- Prefix code
- Prefix computation
- Prefix sum
- Prefix traversal
- Preorder traversal
- Prim's algorithm
- Primary clustering
- Primitive recursive
- Principle of optimality
- Priority queue
- Prisoner's dilemma
- Probabilistic algorithm
- Probabilistically checkable proof
- Probabilistic Turing machine
- Probe sequence
- Procedure (computer science)
- Process algebra
- Proper binary tree
- Proper coloring
- Proper subset
- Property list
- Prune and search
- Pseudorandom number generator
- Pth order Fibonacci numbers
- P-tree
- Public key certificate
- Purely functional language
- Pushdown automaton
- Pushdown transducer
- P-way merge sort
- Qm sort
- Qsort
- Quadratic probing
- Quadtree
- Quadtree complexity theorem
- Quad trie
- Quantum computation
- Queue (data structure)
- Quicksort
- R* tree
- R+ tree
- Rabin–Karp algorithm
- Radix quicksort
- Radix sort
- Ragged matrix
- Raita algorithm
- Random-access machine
- Randomization
- Randomized algorithm
- Randomized binary search tree
- Randomized complexity
- Randomized polynomial time
- Randomized rounding
- Randomized search tree
- Randomized-Select
- Random number generation
- Random number generator
- Random sampling
- Range (function)
- Range sort
- Rank (graph theory)
- Reachable
- Recognizer
- Rectangular matrix
- Rectilinear Steiner tree
- Recurrence equations
- Recurrence relation
- Recursion
- Recursion termination
- Recursion tree
- Recursive (computer science)
- Recursive data structure
- Recursive doubling
- Recursive language
- Recursively enumerable language
- Recursively solvable
- Red–black tree
- Reduced basis
- Reduced digraph
- Reduced ordered binary decision diagram
- Reduction (complexity)
- Reference (computer science)
- Reflexive relation
- Regular decomposition
- Rehashing
- Relation (mathematics)
- Relational structure
- Relative performance guarantee
- Relaxation technique (mathematics)
- Relaxed balance
- Rescalable
- Restricted universe sort
- Result cache
- Reverse Colussi
- Reverse Factor
- R-file
- Rice's method
- Right rotation
- Right-threaded tree
- Root
- Root balance
- Rooted tree
- Rotate left
- Rotate right
- Rotation
- Rough graph
- RP (complexity)
- R-tree
- Run time (program lifecycle phase)
- Saguaro stack
- Saturated edge
- Scapegoat tree
- Search algorithm
- Search tree
- Search tree property
- Secant search
- Secondary clustering
- Select and partition
- Selection algorithm
- Selection sort
- Select mode
- Self-balancing binary search tree
- Self-organizing heuristic
- Self-organizing list
- Self-organizing sequential search
- Semidefinite programming
- Separate chaining hashing
- Sequential search
- Set (abstract data type)
- Set cover problem
- Set packing
- Seven Bridges of Königsberg
- Shadow heap
- Shadow merge
- Shadow merge insert
- Shannon–Fano coding
- Shared memory
- Shell sort
- Shift-Or
- Shor's algorithm
- Shortcutting
- Shortest common supersequence problem
- Shortest common superstring
- Shortest path
- Shortest spanning tree
- Shuffle
- Shuffle sort
- Shuffling
- Sibling
- Sierpiński curve
- Sierpinski triangle
- Sieve of Eratosthenes
- Sift up
- Signature
- Simon's algorithm
- Simple merge
- Simple uniform hashing
- Simplex communication
- Simulated annealing
- Simulation theorem
- Single-destination shortest-path problem
- Single-pair shortest-path problem
- Single program multiple data
- Single-source shortest-path problem
- Singly linked list
- Singularity analysis
- Sink
- Sinking sort
- Skd-tree
- Skew-symmetry
- Skip list
- Skip search
- Slope selection
- Smith algorithm
- Smith–Waterman algorithm
- Smoothsort
- Solvable problem
- Sort algorithm
- Sorted array
- Sorted list
- Sort merge
- Soundex
- space complexity
- Space-constructible function
- Spanning tree (mathematics)
- Sparse graph
- Sparse matrix
- Sparsification
- Sparsity
- Spatial index
- Spectral test
- Splay tree
- SPMD
- Square matrix
- Square root
- Stack (data structure)
- Stack tree
- Star-shaped polygon
- Start state
- State (computer science)
- State machine
- State transition
- Static data structure
- Static Huffman encoding
- S-t cut
- St-digraph
- Steiner minimum tree
- Steiner ratio
- Steiner tree
- Steiner tree problem
- Steiner vertex
- Steinhaus–Johnson–Trotter algorithm
- Stirling's approximation
- Stirling's formula
- Stooge sort
- Straight-line drawing
- Strand sort
- Strictly decreasing
- Strictly increasing
- Strictly lower triangular matrix
- Strictly upper triangular matrix
- String (computer science)
- String editing problem
- String matching
- String matching on ordered alphabets
- String matching with errors
- String matching with mismatches
- String searching
- Strip packing
- Strongly connected component
- Strongly connected graph
- Strongly NP-hard
- Subadditive ergodic theorem
- Subgraph isomorphism
- Sublinear time algorithm
- Subsequence
- Subset
- Substring
- Subtree
- Suffix (computer science)
- Suffix array
- Suffix automaton
- Suffix tree
- Superimposed code
- Superset
- Supersink
- Supersource
- Symmetrically linked list
- Symmetric binary B-tree
- Symmetric min max heap
- Symmetric relation
- Symmetric set difference
- Symmetry breaking
- Tail
- Tail recursion
- Tango tree
- Target (CS)
- Temporal logic
- Ternary search
- Ternary search tree
- Text searching
- Theta
- Threaded binary tree
- Threaded tree
- Three-dimensional space
- Three-way merge sort
- Three-way radix quicksort
- Time-constructible function
- Top-down radix sort
- Top-down tree automaton
- Top-nodes algorithm
- Topological order
- Topological sort
- Topology tree
- Total function
- Totally decidable language
- Totally decidable problem
- Totally undecidable problem
- Total order
- Tournament (graph theory)
- Towers of Hanoi
- Tractable problem
- Transducer
- Transitive closure
- Transitive reduction
- Transitive relation
- Transpose sequential search
- Travelling salesman problem
- Treap
- Tree automaton
- Tree contraction
- Tree data structure
- Tree editing problem
- Tree sort
- Tree structure
- Tree transducer
- Tree traversal
- Triangle inequality
- Triconnected graph
- Trie
- Trinary function
- Tripartition
- Turbo-BM
- Turbo Reverse Factor
- Turing machine
- Turing reduction
- Turing transducer
- Twin grid file
- Two-dimensional
- Two-level grid file
- Two Way algorithm
- Two-way linked list
- Two-way merge sort
- Unary function
- Unbounded knapsack problem
- Uncomputable function
- Uncomputable problem
- Undecidable language
- Undecidable problem
- Undirected graph
- Uniform circuit complexity
- Uniform circuit family
- Uniform hashing
- Uniform matrix
- Union (computer science)
- Union of automata
- Universal hashing
- Universal state (Turing)
- Universal Turing machine
- Universe
- Unsolvable problem
- Unsorted list
- Upper triangular matrix
- Van Emde Boas tree
- Vehicle routing problem
- Veitch diagram
- Venn diagram
- Vertex (graph theory)
- Vertex coloring
- Vertex connectivity
- Vertex cover
- Vertical visibility map
- Virtual hashing
- Visibility map
- Visible (geometry)
- Viterbi algorithm
- VP-tree
- Weak cluster
- Weak-heap
- Weak-heap sort
- Weight-balanced tree
- Weighted, directed graph
- Weighted graph
- Wikt: rectilinear
- Work-depth model
- Work-efficient
- Work-preserving
- Worst-case minimum access
- Xiaolin Wu's line algorithm
- Xor
- Yule–Simon distribution
- Zeller's congruence
- Zhu–Takaoka string matching algorithm
- Zipf's law
- Zipfian distribution
- Zipper (data structure)
- ZPP (complexity)
- Num
- enyes
- Reason
- enThis list is based on the NIST "Dictionary of Algorithms and Data Structures," which was published online in 1998
- SameAs
- b4AQ
- Q16002499
- Side
- enyes
- Subject
- Category:Algorithms and data structures
- Category:Lists of computer terms
- Category:Mathematics-related lists
- Top
- enyes
- WasDerivedFrom
- List of terms relating to algorithms and data structures?oldid=1089463864&ns=0
- WikiPageInterLanguageLink
- 数据结构与算法列表
- WikiPageLength
- 35312
- Wikipage page ID
- 723738
- Wikipage revision ID
- 1089463864
- WikiPageUsesTemplate
- Template:Compact ToC
- Template:Outdated
- Template:Reflist
- Template:Short description