Manual Sort without Sort function

[snippsat]

First would make a list of the numbers.

#Get user input
numb_list = []
numbers = input("Enter three numbers separated by space: ")
numb_list = [int(i) for i in numbers.split()]
sort_list = []

So could take the the first number in numb_list and compare if number is less(<) than other number in number list.
Then make a temporary variable,and append that number to sort_list and remove from numb_list.
All this is done as long as there are numbers in numb_list.
It's hard to explain this stuff   

The start look like this:

while numb_list:
    first_number = numb_list[0]
    for n in numb_list:
        if n < first_number:

Do small test to understand it:

>>> lst = [50, 2, 1]
>>> for n in lst:
...     if n < 50:
...         print(n)
...         x = n
... 
2
1
>>> x
1

# x will always be the lowest number
>>> lst = [5, 100, 789, 4, 5678, 1, 444]
>>> for n in lst:
...     if n < 5:
...         print(n)
...         x = n
... 
4
1
>>> x
1