Local Minimum
Local Minimum Linear Search Local minimum search finds an index where the element is smaller than its immediate neighbors. Unlike global minimum, it does not require scanning for the smallest value in the entire sequence. A linear scan guarantees finding one local minimum. Problem Given a sequence $A$ of length $n$, find an index $i$ such that $$ A[i] \le A[i-1] \quad \text{and} \quad A[i] \le A[i+1] $$ with boundary...