


'''simple docstring'''






def     UpperCamelCase_      (   A__ :       list ):
  '''simple docstring'''





  for i in range(len(A__ ) - 1							,   0							,   -1 ):
    lowerCAmelCase_      :				Dict      =       False

    for j in range(A__							,   0							,   -1 ):
      if unsorted[j] < unsorted[j - 1]:
        lowerCAmelCase_,							lowerCAmelCase_      :				Union[str, Any]      =       unsorted[j - 1], unsorted[j]
        lowerCAmelCase_      :				List[Any]      =       True

    for j in range(A__ ):
      if unsorted[j] > unsorted[j + 1]:
        lowerCAmelCase_,							lowerCAmelCase_      :				List[Any]      =       unsorted[j + 1], unsorted[j]
        lowerCAmelCase_      :				List[Any]      =       True

    if not swapped:
      break
  return unsorted


if __name__ == "__main__":
  import doctest

  doctest.testmod()
  __A :  Dict    							=				input("Enter numbers separated by a comma:\n").strip()
  __A :  Any    							=				[int(item) for item in user_input.split(",")]
  print(F'''{cocktail_shaker_sort(unsorted) = }''')







'''simple docstring'''






from __future__ import annotations







def     UpperCamelCase_      (   A__ :       int | float | str							,   A__ :       int | float | str ):
  '''simple docstring'''





  if nth_term == "":
    return [""]
  lowerCAmelCase_      :				str      =       int(A__ )
  lowerCAmelCase_      :				Tuple      =       int(A__ )
  lowerCAmelCase_      :				list[str]      =       []
  for temp in range(int(A__ ) ):
    series.append(f'1 / {pow(temp + 1							,   int(A__ ) )}' if series else """1""" )
  return series


if __name__ == "__main__":
  import doctest

  doctest.testmod()

  __A :  str    							=				int(input("Enter the last number (nth term) of the P-Series"))
  __A :  Tuple    							=				int(input("Enter the power for  P-Series"))
  print("Formula of P-Series => 1+1/2^p+1/3^p ..... 1/n^p")
  print(p_series(nth_term, power))



