You are given an n by n matrix of integers such that all rows and all columns ar

Question

You are given an n by n matrix of integers such that all rows and all columns are increasing. So every row read left to right is an increasing sequence of integers and every column read from top to bottom is an increasing sequence of integers. You would like to determine if an integer k is in the matrix. You can access any entry of the matrix (it costs one unit of time to access an entry in the matrix). Come up with a "divide and conquer" algorithm that solves this problem by splitting the matrix into quadrants. Explain why your algorithm is correct. Write a recurrence for the running time of this algorithm. Determine the Big-O time complexity of this algorithm.

Explanation / Answer

1. Let A be the n*n array. 2. Report the element doesn't exist in the array, if the search element e doesn't satisfy the condition A[1,1]

Related Questions

Navigate

• Browse (All)
• Browse Y
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.