def sort(li):
    ret = []
    i = 0
    while i < len(li):
        j = 0
        while li[j] in ret:
            j += 1
        min = li[j]

        k = 0
        while k < len(li):
            if li[k] < min and li[k] not in ret:
                min = li[k]
            k += 1
        ret.append(min)
        i += 1
    return ret


print(sort([4, 5, 2, 8, 1, 0, 3, 7]))