selsort.py

def selection_sort(l):
    for i in range(len(l)-1):
        minimum = l[i]
        minimum_pos = i
        for j in range(i+1, len(l)):
            if l[j] < minimum:
                minimum = l[j]
                minimum_pos = j
        l[i], l[minimum_pos] = l[minimum_pos], l[i]
    return l

import random
l = [random.randint(1, 20) for _ in range(20)]
print(selection_sort(l))