Tuluttut nassiussatikkut saniaanutsalu allatut ilinniartitsisut, kingorna marluk suliarineqarsinnaavoq.
Assigiisaq = [2, 3, 6, 7, 8, 10, 12]
Timmersortarfik = 8
Naamaseq aatsitassaq pythoniut peqarfiup suliarineqarnera binary search algorithm, tamakkuursinnaassuseq arlalinnut tunngasut peqataasut: 

```
def binary_search(arr, x):
    low = 0
    high = len(arr) - 1
    mid = 0
    
    while low <= high:
        mid = (high + low) // 2
        
        # If x is greater, ignore left half
        if arr[mid] < x:
            low = mid + 1
        # If x is smaller, ignore right half
        elif arr[mid] > x:
            high = mid - 1
        # means x is present at mid
        else:
            return mid
    
    # If we reach here, then the element is not present
    return -1

# Test the code
arr = [2, 3, 6, 7, 8, 10, 12]
x = 8
result = binary_search(arr, x)
if result != -1:
    print("Element is present at index", str(result))
else:
    print("Element is not present in array")
```