AlgorithmsInPython/matrix/searching_in_sorted_matrix.py at master · icgowtham/AlgorithmsInPython · GitHub

History

44 lines (37 loc) · 1.24 KB

Raw

from typing import List, Union

def search_in_a_sorted_matrix(

mat: List[list], m: int, n: int, key: Union[int, 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

while i >= 0 and j < n:

if key == mat[i][j]:

print(f"Key {key} found at row- {i + 1} column- {j + 1}")

return

if key < mat[i][j]:

i -= 1

else:

j += 1

print(f"Key {key} not found")

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__":

import doctest

doctest.testmod()

main()

AlgorithmsInPython/matrix/searching_in_sorted_matrix.py at master · icgowtham/AlgorithmsInPython · GitHub

Expand file tree

Breadcrumbs

searching_in_sorted_matrix.py

Latest commit

History

Breadcrumbs

searching_in_sorted_matrix.py

File metadata and controls