tag

#peak-finding

2 pages tagged

Wiki › Algorithms › 01. Searching and Sorting › 2. Binary Search and Ordered Search ›

One Dimensional Peak Finding

One Dimensional Peak Finding One dimensional peak finding finds an index whose value is at least as large as its immediate neighbors. Unlike maximum search, it does not require finding the global maximum. Any local peak is enough. For an array $A$, index $i$ is a peak if: $i = 0$ and $A[0] \ge A[1]$ $i = n - 1$ and $A[n - 1] \ge A[n - 2]$ otherwise, $A[i]...

Wiki › Algorithms › 01. Searching and Sorting › 2. Binary Search and Ordered Search ›

Two Dimensional Peak Finding

Two Dimensional Peak Finding Two dimensional peak finding finds a position in a matrix whose value is at least as large as its neighbors in four directions. Given a matrix $A$ of size $n \times m$, a position $(i, j)$ is a peak if: $A[i][j] \ge A[i-1][j]$ $A[i][j] \ge A[i+1][j]$ $A[i][j] \ge A[i][j-1]$ $A[i][j] \ge A[i][j+1]$ Out of bounds neighbors are treated as $-\infty$. Problem Given a matrix $A$, find...