


def    SCREAMING_SNAKE_CASE							(			snake_case       )		->						list:
		if len(snake_case       ) <= 1:
				return data
		else:
				return [
				    *quick_sort([e for e in data[1:] if e <= data[0]]       ),
				    data[0],
				    *quick_sort([e for e in data[1:] if e > data[0]]       ),
				]


if __name__ == "__main__":
		import doctest

		doctest.testmod()











from __future__ import annotations



def    SCREAMING_SNAKE_CASE							(			snake_case	,      snake_case	,      snake_case	,      snake_case       )		->						None:
		__lowercase	,			__lowercase					=    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    SCREAMING_SNAKE_CASE							(			)		->						None:
		__lowercase					=    [[2, 5, 7], [4, 8, 13], [9, 11, 15], [12, 17, 20]]
		__lowercase					=    int(input('Enter the element to be searched:'       )       )
		print(snake_case       )
		search_in_a_sorted_matrix(snake_case	,      len(snake_case       )	,      len(mat[0]       )	,      snake_case       )


if __name__ == "__main__":
		import doctest

		doctest.testmod()
		main()




