### matrices - Is this a proper algorithm/time complexity for finding a value in this matrix?

You have a n by n matrix that increases in value going from left to right and from top to bottom. Here is an example matrix: 1 2 3 4 2 3 4 5 3 4 5 6 4 5 6 7 Now you have to find a "divide and conquer" algorithm to find if a value 'S'is in this sorted matrix. Find a recurrence relation and state the timecomplexity.Here is my solution:1. Find bottom left value (Time Steps: 1)2. If 'S' is greater than this value, move right, otherwise, move up3. Worse case, you traverse a whole row to the right or a whole column up. -So let this be notated as 'n...Read more