20 year old from germany.

Best sorting algorithm on earth

from time import sleep
L = [1,3,5,2,5,42,6,3,6,3,6,67,7,7,7,456,456,4,234,426,23,2,45,2]
out = []
def proc(val):
    sleep(val / 1000)
    out.append(val)
for i in L:
    thread = Thread(target = proc, args = (i, ))
    thread.start()
sleep((max(L) + 1) / 1000)
print(out)