2020-07-03 19:28:16 +00:00
|
|
|
from typing import List
|
|
|
|
|
|
|
|
|
|
|
|
def search_in_a_sorted_matrix(
|
|
|
|
mat: List[list], m: int, n: int, key: int or 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
|
|
|
|
'''
|
2019-03-20 15:59:35 +00:00
|
|
|
i, j = m - 1, 0
|
|
|
|
while i >= 0 and j < n:
|
|
|
|
if key == mat[i][j]:
|
2020-07-03 19:28:16 +00:00
|
|
|
print(f"Key {key} found at row- {i + 1} column- {j + 1}")
|
2019-03-20 15:59:35 +00:00
|
|
|
return
|
|
|
|
if key < mat[i][j]:
|
|
|
|
i -= 1
|
|
|
|
else:
|
|
|
|
j += 1
|
2020-07-03 19:28:16 +00:00
|
|
|
print(f"Key {key} not found")
|
2019-03-20 15:59:35 +00:00
|
|
|
|
|
|
|
|
|
|
|
def main():
|
2019-10-05 05:14:13 +00:00
|
|
|
mat = [[2, 5, 7], [4, 8, 13], [9, 11, 15], [12, 17, 20]]
|
2019-03-20 15:59:35 +00:00
|
|
|
x = int(input("Enter the element to be searched:"))
|
|
|
|
print(mat)
|
|
|
|
search_in_a_sorted_matrix(mat, len(mat), len(mat[0]), x)
|
|
|
|
|
|
|
|
|
2019-10-05 05:14:13 +00:00
|
|
|
if __name__ == "__main__":
|
2020-07-03 19:28:16 +00:00
|
|
|
import doctest
|
|
|
|
doctest.testmod()
|
2019-03-20 15:59:35 +00:00
|
|
|
main()
|