삽입 정렬

주어진 배열중 두번쨰 항부터 하나씩 빼서 비교후 위치변경

def sorted_num(arr):
    a = len(arr)
    for i in range(1, a):
        print(f'num : {arr}')
        for j in range(i, 0, -1):
            if arr[j] < arr[j - 1]:
                arr[j], arr[j - 1] = arr[j - 1], arr[j]
            else:
                break
    return arr

def reverse_num(arr):
    a = len(arr)
    for i in range(1, a):
        print(f'num : {arr}')
        for j in range(i, 0, -1):
            if arr[j] > arr[j - 1]:
                arr[j], arr[j - 1] = arr[j - 1], arr[j]
            else:
                break
    return arr
num = [19, 10, 3, 5, 13, 4, 12, 17, 8, 16]
print(f'sort nums by ASC : \n{sorted_num(num)}')
print(f'sort nums by DESC : \n{reverse_num(num)}')