






def 					lowercase__				(					__snake_case   :							str = "The quick brown fox jumps over the lazy dog"					,	):


					'''simple docstring'''


					UpperCAmelCase_						=						set()

					# Replace all the whitespace in our sentence
					UpperCAmelCase_						=						input_str.replace(' '					,	''  )
					for alpha in input_str:
										if "a" <= alpha.lower() <= "z":
															frequency.add(alpha.lower()  )
					return len(lowerCamelCase_  ) == 26




def 					lowercase__				(					__snake_case   :							str = "The quick brown fox jumps over the lazy dog"					,	):


					'''simple docstring'''


					UpperCAmelCase_						=						[False] * 26
					for char in input_str:
										if char.islower():
															UpperCAmelCase_						=						True
										elif char.isupper():
															UpperCAmelCase_						=						True
					return all(lowerCamelCase_  )




def 					lowercase__				(					__snake_case   :							str = "The quick brown fox jumps over the lazy dog"					,	):


					'''simple docstring'''


					return len({char for char in input_str.lower() if char.isalpha()}  ) == 26




def 					lowercase__				(					):


					'''simple docstring'''


					from timeit import timeit

					UpperCAmelCase_						=						'''from __main__ import is_pangram, is_pangram_faster, is_pangram_fastest'''
					print(timeit('is_pangram()'					,	setup=lowerCamelCase_  )  )
					print(timeit('is_pangram_faster()'					,	setup=lowerCamelCase_  )  )
					print(timeit('is_pangram_fastest()'					,	setup=lowerCamelCase_  )  )
					# 5.348480500048026, 2.6477354579837993, 1.8470395830227062
					# 5.036091582966037, 2.644472333951853,  1.8869528750656173


if __name__ == "__main__":
		import doctest

		doctest.testmod()
		benchmark()














from __future__ import annotations




def 					lowercase__				(					__snake_case   :							list[int]					,	__snake_case   :							int  ):


					'''simple docstring'''


					if len(__snake_case  ) == 0:
										return False
					UpperCAmelCase_   :				Optional[int]						=						len(__snake_case  ) // 2
					if a_list[midpoint] == item:
										return True
					if item < a_list[midpoint]:
										return binary_search(a_list[:midpoint]					,	__snake_case  )
					else:
										return binary_search(a_list[midpoint + 1 :]					,	__snake_case  )


if __name__ == "__main__":
		__UpperCAmelCase     							=						input('Enter numbers separated by comma:\n').strip()
		__UpperCAmelCase     							=						[int(item.strip()) for item in user_input.split(',')]
		__UpperCAmelCase     							=						int(input('Enter the number to be found in the list:\n').strip())
		__UpperCAmelCase     							=						'' if binary_search(sequence, target) else 'not '
		print(F'{target} was {not_str}found in {sequence}')






