Skip to content

Latest commit

 

History

History
3 lines (2 loc) · 175 Bytes

File metadata and controls

3 lines (2 loc) · 175 Bytes

monotonic-matrix-divide-and-conquer

A simple program demonstrating O(n*log(n)) search on a monotonic matrix, versus the O(n**2) search required for a non-monotonic matrix.