forked from TheAlgorithms/Python
-
Notifications
You must be signed in to change notification settings - Fork 0
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Create Searching in sorted matrix (TheAlgorithms#738)
* Create Searching in sorted matrix * Rename Searching in sorted matrix to searching_in_sorted_matrix.py
- Loading branch information
Showing
1 changed file
with
27 additions
and
0 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,27 @@ | ||
def search_in_a_sorted_matrix(mat, m, n, key): | ||
i, j = m - 1, 0 | ||
while i >= 0 and j < n: | ||
if key == mat[i][j]: | ||
print('Key %s found at row- %s column- %s' % (key, i + 1, j + 1)) | ||
return | ||
if key < mat[i][j]: | ||
i -= 1 | ||
else: | ||
j += 1 | ||
print('Key %s not found' % (key)) | ||
|
||
|
||
def main(): | ||
mat = [ | ||
[2, 5, 7], | ||
[4, 8, 13], | ||
[9, 11, 15], | ||
[12, 17, 20] | ||
] | ||
x = int(input("Enter the element to be searched:")) | ||
print(mat) | ||
search_in_a_sorted_matrix(mat, len(mat), len(mat[0]), x) | ||
|
||
|
||
if __name__ == '__main__': | ||
main() |