



'''simple docstring'''





from __future__ import annotations



def __lowerCAmelCase (     SCREAMING_SNAKE_CASE_						,  SCREAMING_SNAKE_CASE_  ):
			lowercase__  ,       lowercase__					  =				set(snake_case__  ), [start]

			while stack:
						lowercase__					  =				stack.pop()
						explored.add(snake_case__  )
						# Differences from BFS:
						# 1) pop last element instead of first one
						# 2) add adjacent elements to stack without exploring them
						for adj in reversed(graph[v]  ):
									if adj not in explored:
												stack.append(snake_case__  )
			return explored


lowercase_								=     {
    """A""": ["""B""", """C""", """D"""],
    """B""": ["""A""", """D""", """E"""],
    """C""": ["""A""", """F"""],
    """D""": ["""B""", """D"""],
    """E""": ["""B""", """F"""],
    """F""": ["""C""", """E""", """G"""],
    """G""": ["""F"""],
}

if __name__ == "__main__":
							import doctest

							doctest.testmod()
							print(depth_first_search(G, """A"""))









def __lowerCAmelCase (     SCREAMING_SNAKE_CASE_  ):
			lowercase__					  =				len(SCREAMING_SNAKE_CASE_  )
			for i in range(SCREAMING_SNAKE_CASE_  ):
						for j in range(i + 1						,  SCREAMING_SNAKE_CASE_  ):
									if numbers[j] < numbers[i]:
												lowercase__  ,       lowercase__					  =				numbers[j], numbers[i]
			return numbers


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




