forked from TheAlgorithms/Python
- Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathsearching_in_sorted_matrix.py
42 lines (35 loc) · 1.25 KB
/
searching_in_sorted_matrix.py
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
from __future__ importannotations
defsearch_in_a_sorted_matrix(mat: list[list[int]], m: int, n: int, key: float) ->None:
"""
>>> search_in_a_sorted_matrix(
... [[2, 5, 7], [4, 8, 13], [9, 11, 15], [12, 17, 20]], 3, 3, 5)
Key 5 found at row- 1 column- 2
>>> search_in_a_sorted_matrix(
... [[2, 5, 7], [4, 8, 13], [9, 11, 15], [12, 17, 20]], 3, 3, 21)
Key 21 not found
>>> search_in_a_sorted_matrix(
... [[2.1, 5, 7], [4, 8, 13], [9, 11, 15], [12, 17, 20]], 3, 3, 2.1)
Key 2.1 found at row- 1 column- 1
>>> search_in_a_sorted_matrix(
... [[2.1, 5, 7], [4, 8, 13], [9, 11, 15], [12, 17, 20]], 3, 3, 2.2)
Key 2.2 not found
"""
i, j=m-1, 0
whilei>=0andj<n:
ifkey==mat[i][j]:
print(f"Key {key} found at row- {i+1} column- {j+1}")
return
ifkey<mat[i][j]:
i-=1
else:
j+=1
print(f"Key {key} not found")
defmain() ->None:
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__":
importdoctest
doctest.testmod()
main()