tag

#linear-scan

3 pages tagged

Wiki › Algorithms › 01. Searching and Sorting › 1. Linear and Sequential Search ›

Maximum Search

Maximum Search Maximum search finds the largest value in a sequence and returns its index. It performs a single pass while maintaining the best candidate seen so far. This is symmetric to minimum search and appears in many selection and optimization routines. Problem Given a sequence $A$ of length $n$, find an index $i$ such that $$ A[i] = \max_{0 \le j < n} A[j] $$ If multiple positions share...
algorithms searching linear-scan
Wiki › Algorithms › 01. Searching and Sorting › 1. Linear and Sequential Search ›

Min Max Search

Min Max Search Min max search finds both the minimum and maximum values in one traversal. Instead of running two separate scans, it maintains both extrema simultaneously. This reduces constant overhead and serves as a base for more advanced selection algorithms. Problem Given a sequence $A$ of length $n$, find indices $i$ and $j$ such that $$ A[i] = \min_{0 \le k < n} A[k], \quad A[j] = \max_{0 \le...
algorithms searching linear-scan
Wiki › Algorithms › 01. Searching and Sorting › 1. Linear and Sequential Search ›

Minimum Search

Minimum Search Minimum search finds the smallest value in a sequence and returns its index. It scans the sequence once while maintaining the best candidate seen so far. This is a fundamental primitive used in selection, sorting, and optimization routines. Problem Given a sequence $A$ of length $n$, find an index $i$ such that $$ A[i] = \min_{0 \le j < n} A[j] $$ If multiple positions share the minimum...
algorithms searching linear-scan