



'''simple docstring'''






def  snake_case_     (					_lowerCAmelCase  :						Optional[Any]  )      ->   List[str]:
							UpperCAmelCase							,		UpperCAmelCase :       List[str] 							=		[], []
							while len(_lowerCAmelCase  ) > 1:
														UpperCAmelCase							,		UpperCAmelCase :       Tuple 							=		min(_lowerCAmelCase  ), max(_lowerCAmelCase  )
														start.append(_lowerCAmelCase  )
														end.append(_lowerCAmelCase  )
														collection.remove(_lowerCAmelCase  )
														collection.remove(_lowerCAmelCase  )
							end.reverse()
							return start + collection + end


if __name__ == "__main__":
						UpperCamelCase__:   List[Any]								=			input("Enter numbers separated by a comma:\n").strip()
						UpperCamelCase__:   str								=			[int(item) for item in user_input.split(",")]
						print(*merge_sort(unsorted), sep=",")










'''simple docstring'''






from __future__ import annotations


def  snake_case_     (					_lowerCAmelCase  :						str   ,      _lowerCAmelCase  :						str  )      ->   bool:
							UpperCAmelCase :       str 							=		get_failure_array(_lowerCAmelCase  )

							# 2) Step through text searching for pattern
							UpperCAmelCase							,		UpperCAmelCase :       Optional[Any] 							=		0, 0  # index into text, pattern
							while i < len(_lowerCAmelCase  ):
														if pattern[j] == text[i]:
																					if j == (len(_lowerCAmelCase  ) - 1):
																												return True
																					j += 1

														# if this is a prefix in our pattern
														# just go back far enough to continue
														elif j > 0:
																					UpperCAmelCase :       Optional[Any] 							=		failure[j - 1]
																					continue
														i += 1
							return False


def  snake_case_     (					_lowerCAmelCase  :						str  )      ->   list[int]:
							UpperCAmelCase :       Optional[Any] 							=		[0]
							UpperCAmelCase :       str 							=		0
							UpperCAmelCase :       List[str] 							=		1
							while j < len(_lowerCAmelCase  ):
														if pattern[i] == pattern[j]:
																					i += 1
														elif i > 0:
																					UpperCAmelCase :       Union[str, Any] 							=		failure[i - 1]
																					continue
														j += 1
														failure.append(_lowerCAmelCase  )
							return failure


if __name__ == "__main__":
						# Test 1)
						UpperCamelCase__:   str								=			"abc1abc12"
						UpperCamelCase__:   str								=			"alskfjaldsabc1abc1abc12k23adsfabcabc"
						UpperCamelCase__:   Any								=			"alskfjaldsk23adsfabcabc"
						assert kmp(pattern, texta) and not kmp(pattern, texta)

						# Test 2)
						UpperCamelCase__:   Tuple								=			"ABABX"
						UpperCamelCase__:   Union[str, Any]								=			"ABABZABABYABABX"
						assert kmp(pattern, text)

						# Test 3)
						UpperCamelCase__:   Any								=			"AAAB"
						UpperCamelCase__:   str								=			"ABAAAAAB"
						assert kmp(pattern, text)

						# Test 4)
						UpperCamelCase__:   int								=			"abcdabcy"
						UpperCamelCase__:   Any								=			"abcxabcdabxabcdabcdabcy"
						assert kmp(pattern, text)

						# Test 5)
						UpperCamelCase__:   List[str]								=			"aabaabaaa"
						assert get_failure_array(pattern) == [0, 1, 0, 1, 2, 3, 4, 5, 2]





