nums = [90, 3, -2, 111, 2]


def bubble_sort_rosnaco(lista):
    for i in range(len(lista)-1, 0, -1):
        for j in range(i):
            if lista[j] > lista[j + 1]:
                lista[j], lista[j+1] = lista[j+1], lista[j]


def bubble_sort_malejoco(lista):
    for i in range(len(lista)-1, 0, -1):
        for j in range(i):
            if lista[j] < lista[j + 1]:
                lista[j], lista[j+1] = lista[j+1], lista[j]


bubble_sort_rosnaco(nums)
print(nums)
bubble_sort_malejoco(nums)
print(nums)


def insertionSort_rosnaco(arr):
    for i in range(1, len(arr)):
        key = arr[i]
        j = i - 1
        while j >= 0 and key < arr[j]:
            arr[j+1] = arr[j]
            j -= 1
        arr[j+1] = key



def insertionSort_malejoco(arr):
    for i in range(1, len(arr)):
        key = arr[i]
        j = i - 1
        while j >= 0 and key > arr[j]:
            arr[j+1] = arr[j]
            j -= 1
        arr[j+1] = key


insertionSort_rosnaco(nums)
print(nums)
insertionSort_malejoco(nums)
print(nums)


def sortowanie_wybor_rosnaco(arr):
    for i in range(len(arr)):
        min_index = i
        for j in range(i+1, len(arr)):
            if arr[j] < arr[min_index]:
                min_index = j
        arr[i], arr[min_index] = arr[min_index], arr[i]


def sortowanie_wybor_malejaco(arr):
    for i in range(len(arr)):
        min_index = i
        for j in range(i+1, len(arr)):
            if arr[j] > arr[min_index]:
                min_index = j
        arr[i], arr[min_index] = arr[min_index], arr[i]


sortowanie_wybor_rosnaco(nums)
print(nums)
sortowanie_wybor_malejaco(nums)
print(nums)


def wyszukiwanie_binarne(lista, k):  # - k - szukany element
    l = 0
    p = len(lista)-1
    while l < p:
        srodek = (l+p) // 2
        if lista[srodek] < k:
            l = srodek + 1
        else:
            p = srodek
    if lista[l] == k:
        return l
    else:
        return -1


print(nums)
print(wyszukiwanie_binarne(nums, 111))