jkeys-ecg-nmsu / monotonic-matrix-divide-and-conquer Public

Notifications You must be signed in to change notification settings
Fork 0
Star 0

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.

0 stars 0 forks Branches Tags Activity

Notifications

Name		Name	Last commit message	Last commit date
Latest commit History 4 Commits
LICENSE		LICENSE
Lab3.pdf		Lab3.pdf
MatrixSearch.cpp		MatrixSearch.cpp
R-plot.png		R-plot.png
README.md		README.md
makefile		makefile

Repository files navigation

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.

About

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.

c-plus-plus algorithm cpp recursion monotonicity matrix-functions r-language search-algorithm recursive-algorithm complexity-analysis divide-and-conquer algorithm-complexity monotonic-matrix matrix-search

Report repository

Releases

No releases published

Packages

No packages published

Languages