hi,
im a second year communication engineering student and taking a algorithms and data structures course.
we got a question no have been able to solve:

Let M be a matrix with m rows and n columns(m n) with the following
property:if the minimal value in row i is located at M(ij),then the
minimal value in row i+1 is located at M(i+1k),where k j.Design
an algorithm with running time O(n) that finds minimal value for every
row in M.

weve been working on it for more than a week now with no answer. the we came up with is O(nlogn).
any idea,help,moral support aprriciated.

thanx