mirror of
https://github.com/TheAlgorithms/Python.git
synced 2024-11-23 21:11:08 +00:00
9200a2e543
* from __future__ import annotations
* fixup! from __future__ import annotations
* fixup! from __future__ import annotations
* fixup! Format Python code with psf/black push
Co-authored-by: github-actions <${GITHUB_ACTOR}@users.noreply.github.com>
47 lines
1.3 KiB
Python
47 lines
1.3 KiB
Python
from __future__ import annotations
|
|
|
|
from typing import 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()
|