Suppose that you have numerical data stored in a two-dimensional array, such as the one in Figure 18-9. The data in each row and in each column is sorted in increasing order.
a. Devise an efficient search algorithm for an array of this type.
b. If the array has m rows and n columns, what is the Big Oh performance of your algorithm?
c. Implement and test your algorithm.
