Ugly Insertion Sort

def insertion_sort(unsorted_list):

    sorted_list = []
    while len(unsorted_list) >= 1:
        if len(sorted_list) == 0:
            sorted_list.insert(0,unsorted_list[0])
            del unsorted_list[0]

        else:
            counter = 0
            inserted = False
            while inserted == False:
                if len(sorted_list) > counter:
                    if unsorted_list[0] < sorted_list[counter]:
                        sorted_list.insert(counter,unsorted_list[0])
                        inserted = True
                    counter += 1
                else:
                    sorted_list.append(unsorted_list[0])
                    inserted = True

            del unsorted_list[0]

    return sorted_list