Algorithms

← Back to Domain-Specific Abstractions by Domain

6 domain-specific abstractions whose origin domain is Algorithms.

• Held–Karp algorithm — An exact dynamic-programming algorithm for the traveling-salesman problem that stores the cheapest start-to-end path through each subset of cities, reducing tour enumeration to exponential subset recurrence.
• Hybrid algorithm — An algorithmic design that combines two or more methods for the same problem and selects or switches among them to exploit complementary performance regimes.
• Locality-sensitive hashing — A randomized indexing method using hash families whose collision probability increases with similarity under a target distance measure.
• Maze generation algorithm — An algorithm that constructs a maze by selecting passages in a cell-adjacency graph, usually enforcing connectivity and optionally uniqueness of paths, loops or stylistic constraints.
• Partial sorting — Rearrangement that places the k smallest or largest elements in their fully sorted positions while leaving or discarding the remainder without requiring a total order output.
• Tournament sort — A comparison-sorting algorithm that organizes elements in a tournament tree, repeatedly outputs the winner and updates only the path affected by its replacement.