from dane import set_numbers
from sortowanie_babelkowe import bubble_sort

def binary_search(arr, n):

    index_low = 0
    index_hight = len(arr) - 1
    index_mid = 0

    while index_low <= index_hight:

        index_mid = (index_hight + index_low) // 2

        if arr[index_mid] < n:
            index_low = index_mid + 1
        elif arr[index_mid] > n:
            index_hight = index_mid - 1

        else:
            return index_mid
        
    return -1

tablica = bubble_sort(set_numbers(10))
print("Tablica " + str(tablica))
print("Wyszukamy element " + str(binary_search(tablica, 53)))