insertion sort
def sortNumList(list1):
x = len(list1)-1
while True:
index = 0
while True:
if list1[index] > list1[index+1]:
get = list1[index], list1[index+1]
list1[index+1], list1[index] = get
# print(list1[index], list1[index+1])
index +=1
if index == x:
break
if(all(list1[i] <= list1[i + 1] for i in range(len(list1)-1))):
break
return list1