mirror of
https://github.com/TheAlgorithms/Python.git
synced 2024-10-06 13:49:30 +00:00
46842e8c5b
* Update count_islands_in_matrix.py * Update matrix_class.py * Update matrix_operation.py * Update nth_fibonacci_using_matrix_exponentiation.py * Update searching_in_sorted_matrix.py * Update count_islands_in_matrix.py * Update matrix_class.py * Update matrix_operation.py * Update rotate_matrix.py * Update sherman_morrison.py * Update spiral_print.py * Update count_islands_in_matrix.py * formatting * formatting * Update matrix_class.py * [pre-commit.ci] auto fixes from pre-commit.com hooks for more information, see https://pre-commit.ci Co-authored-by: pre-commit-ci[bot] <66853113+pre-commit-ci[bot]@users.noreply.github.com>
45 lines
1.3 KiB
Python
45 lines
1.3 KiB
Python
from __future__ import annotations
|
|
|
|
|
|
def search_in_a_sorted_matrix(
|
|
mat: list[list[int]], m: int, n: int, key: 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() -> 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__":
|
|
import doctest
|
|
|
|
doctest.testmod()
|
|
main()
|