# Option 1
def sort_numbers(numbers):
result = []
while len(numbers) > 0:
guess = 0
i = 1
while i < len(numbers):
if numbers[guess] > numbers[i]:
guess = i
i += 1
# append the found min to a new list
result.append(numbers.pop(guess))
return result
# Option 2
def sort_numbers_optimized(numbers):
guess = 0
while guess < len(numbers):
i = guess + 1
while i < len(numbers):
if numbers[guess] > numbers[i]:
numbers[guess], numbers[i] = numbers[i], numbers[guess]
i += 1
guess += 1
return numbers
# numbers = [1, 4, 56, -2, 100]
