Definitive Computer Science Specifications, Linux How-To Guides & System Architecture.
Jump Search is an algorithmic search technique designed exclusively for sorted linear data structures. By partitioning the array of size n into fixed blocks...
Jump Point Search (JPS) is an optimization of the A* search algorithm tailored for uniform-cost grid graphs. By systematically eliminating symmetric path alternatives and...
Johnson's algorithm solves the all-pairs shortest path problem for sparse directed graphs with arbitrary edge weights, provided no negative cycles exist. By combining the...
Iterative Deepening Depth-First Search (IDDFS) is a state-space search strategy that repeatedly runs depth-limited search (DLS) with increasing depth bounds until the target state...
An inverted index is a foundational data structure in information retrieval systems that maps content—such as words or numbers—to their locations in a database...
Interpolation search is an advanced algorithmic pattern designed for searching a key in a sorted array that has been uniformly distributed. Unlike binary search,...
Index mapping is a deterministic algorithmic technique that transforms a discrete, sparse, multidimensional, or irregular key space into a compact, dense, contiguous one-dimensional integer...
Incremental heuristic search algorithms, such as Lifelong Planning A* (LPA*) and D* Lite, solve the problem of efficiently finding shortest paths when edge costs...
Iterative Deepening A* (IDA*) is a graph traversal and pathfinding algorithm that merges the memory-efficiency of Iterative Deepening Depth-First Search (IDDFS) with the optimality...
Hopscotch Hashing is an open-addressing hash table algorithm that combines the cache-efficiency of linear probing with the bounded lookup worst-case performance of chaining. By...