Write an algorithm such that if an element in an MxN matrix is 0, its entire row and column are set to 0

Search a sorted matrix: The input consists of a real number x and a matrix A[1..n, 1..m] of nm real values, where A[i, 1..m] and A[1..n, j] are the rows and columns, respectively, of the matrix. The objective is to either state that all of the members of A are greater than x or to locate the largest array entry A[i, j] that is less than or equal to x. Create and evaluate an iterative approach for this issue that looks at the least amount of matrix entries feasible. If you think the issue can be resolved with a straightforward binary search, think twice.

Let u, v and w be three n-dimensional column vectors. We would like to compute r = uvw, which is also an n-dimensional vector. Justify your answer on which of the following sequence of computation is better: (uv)w_or_u(vw)?