Skip to content

FindPeak.md

Latest commit

 

History

History
14 lines (10 loc) · 498 Bytes

FindPeak.md

File metadata and controls

14 lines (10 loc) · 498 Bytes

Find a peak

This is my implementation of finding a peak both in 1-dimensional and 2-dimensional arrays.

Note that in Java, 2D matrices are indexed by rows so I changed the algorithm to process rows instead of columns (differently from the MIT lesson).

The MIT algorithm was this:

  1. Pick the middle column
  2. Find the global max on column j at (i,j)
  3. Compare (i,j-1), (i,j), (i,j+1)
  4. Pick left cols if (i,j-1) > (i,j)
  5. Pick right cols if (i,j+1) > (i,j)