Given an n x n matrix, where every row and column is sorted in increasing order. Given a key, how to decide whether this key is in the matrix.
A linear time complexity is discussed in the previous post. This problem can also be a very good example for divide and conquer algorithms. Following is divide and conquer algorithm.
1) Find the middle element.
2) If middle element is same as key return.
3) If middle element is lesser than key then
….3a) search submatrix on lower side of middle element
….3b) Search submatrix on right hand side.of middle element
4) If middle element is greater than key then
….4a) search vertical submatrix on left side of middle element
….4b) search submatrix on right hand side.
Following Java implementation of above algorithm.
We are given a n*n matrix, the algorithm can be seen as recurring for 3 matrices of size n/2 x n/2. Following is recurrence for time complexity
T(n) = 3T(n/2) + O(1)
The solution of recurrence is O(n1.58) using Master Method.
But the actual implementation calls for one submatrix of size n x n/2 or n/2 x n, and other submatrix of size n/2 x n/2.
This article is contributed by Kaushik Lele. Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above
- Karatsuba algorithm for fast multiplication using Divide and Conquer algorithm
- Divide and Conquer Algorithm | Introduction
- Maximum Subarray Sum using Divide and Conquer algorithm
- Convex Hull using Divide and Conquer Algorithm
- The Skyline Problem using Divide and Conquer algorithm
- Tiling Problem using Divide and Conquer algorithm
- Longest Common Prefix using Divide and Conquer Algorithm
- Closest Pair of Points using Divide and Conquer algorithm
- Dynamic Programming vs Divide-and-Conquer
- Divide and Conquer | Set 5 (Strassen's Matrix Multiplication)
- Advanced master theorem for divide and conquer recurrences
- Search equal, bigger or smaller in a sorted array in Java
- Search element in a sorted matrix
- Randomized Binary Search Algorithm
- Search in a sorted 2D matrix (Stored in row major order)