CS Algorithms:

Q:

***Correct answer will receive a upvote, wrong answer will receive a downvote. Thank you!

1. (12 points) Given an integer matrix A which has n rows and m columns, we define an element A[i,j] is a peak if: A[i][j]A[i+1][j] \&\& A[i][j]A[i1][j]&&A[i][j]A[i][j+1]&&A[i][j] A [i][j1] Design a divide-and-conquer algorithm to find a peak element in this matrix and analyze the time complexity of your algorithm. Notice that you will get a different score if your algorithm meets a different time complexity requirement. The max score which you can obtain is given for each requirement. - Basic requirement: O(nlogm) (max score: 8 points) - Medium requirement: O(m+n) (max score: 12 points)