

'''simple docstring'''

def    A_  ( snake_case ):







		if len(lowerCAmelCase__ ) <= 1:
				return lst

		SCREAMING_SNAKE_CASE:List[Any]						      =					1

		while i < len(lowerCAmelCase__ ):
				if lst[i - 1] <= lst[i]:
						i += 1
				else:
						SCREAMING_SNAKE_CASE:Dict						      =					lst[i], lst[i - 1]
						i -= 1
						if i == 0:
								SCREAMING_SNAKE_CASE:List[Any]						      =					1

		return lst


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









'''simple docstring'''

import random





def    A_  ( snake_case      ,       snake_case      ,       snake_case = False ):
  SCREAMING_SNAKE_CASE:dict						      =					{i: [] for i in range(snake_case )}

  # if probability is greater or equal than 1, then generate a complete graph
  if probability >= 1:
    return complete_graph(snake_case )
  # 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(snake_case ):
    for j in range(i + 1      ,       snake_case ):
      if random.random() < probability:
        graph[i].append(snake_case )
        if not directed:
          # if the graph is undirected, add an edge in from j to i, either
          graph[j].append(snake_case )
  return graph





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


if __name__ == "__main__":
    import doctest

    doctest.testmod()






