
def        __lowerCAmelCase    (       _UpperCamelCase		:  List[str]	)		->							list:
 '''simple docstring'''


 if len(a__	) <= 1:
  return lst

 SCREAMING_SNAKE_CASE								=			1

 while i < len(a__	):
  if lst[i - 1] <= lst[i]:
   i += 1
  else:
   SCREAMING_SNAKE_CASE						,	SCREAMING_SNAKE_CASE								=			lst[i], lst[i - 1]
   i -= 1
   if i == 0:
    SCREAMING_SNAKE_CASE								=			1

 return lst


if __name__ == "__main__":
      a_    :						Dict    		=      input("Enter numbers separated by a comma:\n").strip()
      a_    :						Tuple    		=      [int(item) for item in user_input.split(",")]
      print(gnome_sort(unsorted))




import random


def        __lowerCAmelCase    (       _UpperCamelCase		:  int		,							_UpperCamelCase		:  float		,							_UpperCamelCase		:  bool = False	)		->							dict:
 '''simple docstring'''


 SCREAMING_SNAKE_CASE								=			{i: [] for i in range(_UpperCamelCase	)}

 # if probability is greater or equal than 1, then generate a complete graph
 if probability >= 1:
  return complete_graph(_UpperCamelCase	)
 # if probability is lower or equal than 0, then return a graph without edges
 if probability <= 0:
  return graph

 # for each couple of nodes, add an edge from u to v
 # if the number randomly generated is greater than probability probability
 for i in range(_UpperCamelCase	):
  for j in range(i + 1		,							_UpperCamelCase	):
   if random.random() < probability:
    graph[i].append(_UpperCamelCase	)
    if not directed:
     # if the graph is undirected, add an edge in from j to i, either
     graph[j].append(_UpperCamelCase	)
 return graph


def        __lowerCAmelCase    (       _UpperCamelCase		:  int	)		->							dict:
 '''simple docstring'''


 return {
     i: [j for j in range(_UpperCamelCase	) if i != j] for i in range(_UpperCamelCase	)
 }


if __name__ == "__main__":
      import doctest

      doctest.testmod()

