






from __future__ import annotations






def 							A     (       a_							,a_ = None							,a_ = None					)     ->						None:
					if start is None:
										__UpperCamelCase      :					int       		=0

					if end is None:
										__UpperCamelCase      :					Optional[Any]       		=len(a_					) - 1

					if start >= end:
										return

					__UpperCamelCase      :					List[Any]       		=(start + end) // 2

					slowsort(a_							,a_							,a_					)
					slowsort(a_							,mid + 1							,a_					)

					if sequence[end] < sequence[mid]:
										__UpperCamelCase		,				__UpperCamelCase      :					Dict       		=sequence[mid], sequence[end]

					slowsort(a_							,a_							,end - 1					)


if __name__ == "__main__":
							from doctest import testmod

							testmod()



'''simple docstring'''







def 					snake_case_		(				__SCREAMING_SNAKE_CASE					: str      ,      __SCREAMING_SNAKE_CASE					: str							):



						"""simple docstring"""





						lowercase_	:     List[str]													=       len(__SCREAMING_SNAKE_CASE							)
						lowercase_	:     Optional[int]													=       []
						for i in range(len(__SCREAMING_SNAKE_CASE							) - pat_len + 1							):
												lowercase_	:     Tuple													=       True
												for j in range(__SCREAMING_SNAKE_CASE							):
																		if s[i + j] != pattern[j]:
																								lowercase_	:     List[str]													=       False
																								break
												if match_found:
																		position.append(__SCREAMING_SNAKE_CASE							)
						return position


if __name__ == "__main__":
							assert naive_pattern_search("ABCDEFG", "DE") == [3]
							print(naive_pattern_search("ABAAABCDBBABCDDEBCABC", "ABC"))



