def binary_search(array, l, h, x):
    if h >= l:
        mid = l + (h - l) // 2
        if array[mid] == x:
            return mid
        elif array[mid] > x:
            return binary_search(array, l, mid - 1, x)
        else:
            return binary_search(array, mid + 1, h, x)
    else:
        return -1

arr = [7,19,4,6,11,10]
num = 11
if binary_search(arr, 0, len(arr) - 1, num) != -1:
    print("Elements index is : ", binary_search(arr, 0, len(arr) - 1, num))
else:
    print("Element is not present in array")

# Coded By DHIRAJ SHELKE