basic_sorts

def bubble_sort(l: list) -> None:
    for i in range(len(l)):
        for j in range(len(l)):
            if l[j] > l[i]:
                temp = l[i]
                l[i] = l[j]
                l[j] = temp
    return(l)

ef insert_sort(l: list) -> None:
    for i in range(1, len(l)):
        temp = l[i]
        j = i-1
        while (j >= 0 and l[j] > temp):
            l[j+1] = l[j]
            j-=1
        l[j+1] = temp
    return (l)

def select_sort(l: list) -> None:
    for i in range(len(l)):
        minimum = i
        for j in range(i, len(l)):
            if l[minimum] > l[j]:
                minimum = j
        temp = l[i]
        l[i] = l[minimum]
        l[minimum] = temp
    return(l)

def counting_sort(l: list, lower: int, upper: int) -> None:
    counter = []
    result =  []
    if lower < 0:
        lower = -lower
        lower_minus = 1
    for i in range(len(l)):
        l[i] += lower
    if lower_minus == 1:
        for i in range(lower + upper + 1):
            counter.append(0)
    else:
        for i in range(upper - lower + 1):
            counter.append(0)
    for i in range(len(l)):
        counter[l[i]] += 1
    for i in range(lower + upper + 1):
        if counter [i] > 0:
            for k in range(counter[i]):
                if lower_minus == 1:
                    result.append(i-lower)
                else:
                    result.append(i+lower)
    return result