def mySort(unsorted_list, reverse = False):
    if not unsorted_list:
        return unsorted_list

    largest_number = None
    sorted_numbers = []
    done = False

    while not done:
        largest_number = max(unsorted_list)
        unsorted_list.remove(largest_number)

        if not reverse:
            sorted_numbers.insert(0, largest_number)
        if reverse:
            sorted_numbers.append(largest_number)
        largestnumber = None

    return sorted_numbers

handle = open("numbers.txt")
numbers = handle.readlines()
print mySort(numbers)