AlgoExpert BinarySearch

import math
def binarySearch(array, target):
    left = 0
    right = len(array)-1
    middle = math.trunc((right + left) / 2) 
    while left <= right:
        if array[middle] == target:
            return middle
        elif array[middle] > target:
            right = middle - 1
        else:
            left = middle + 1
        middle = math.trunc((right + left) / 2) 
    return -1