8. Efficient Search in 2D Sorted Array: Find an Element

Objective: Write an algorithm to find an element in 2-dimensional array where rows and columns are sorted respectively.

Input: A two dimensional sorted array, arrA[][].
Output: True or false based on whether the element exists

Approach:

• Start from the right top corner, say element is the matrix element;
• If element >number -> move left
• If element <number -> move down
• If cant move further to find the number , return false

The Movement : 4->9->16->15->The number 15 present : true
The Movement : 4->9->8->7->6->The number 5 present : false

Related Problems:

- Departure and Destination Cities in a given itinerary Beginner
- Front and Back Search in an Array Beginner
- Find the increasing OR decreasing point in an array Beginner
- Maximum Subarray OR Largest Sum Contiguous Subarray Problem – Divide and Conquer Hard
- Print sorted unique elements of a given array Beginner