def binary_search(arr, target):
    left = 0;
    right = len(arr) - 1
    while left < right:
        mid = left + (right - left) / 2;
        if arr[mid] == target:
            return mid
        elif arr[mid] < target:
            left = mid + 1
        else:
            right = mid - 1
    return left

print(binary_search([1, 2, 3, 10], 1) == 0)
print(binary_search([1, 2, 3, 10], 2) == 1)
print(binary_search([1, 2, 3, 10], 3) == 2)
print(binary_search([1, 2, 3, 10], 10) == 3)
print(binary_search([1, 2, 3, 10], 9) == 3)
print(binary_search([1, 2, 3, 10], 4) == 3)
print(binary_search([1, 2, 3, 10], 0) == 0)
print(binary_search([1, 2, 3, 10], 11) == 3)
print(binary_search([5, 7, 8, 10], 3) == 0)

def binary_search(arr, target):
    left = 0;
    right = len(arr) - 1
    while left < right:
        mid = left + (right - left) // 2;
        if arr[mid] == target:
            return mid
        elif arr[mid] < target:
            left = mid + 1
        else:
            right = mid - 1
    return left

print(binary_search([1, 2, 3, 10], 1) == 0)
print(binary_search([1, 2, 3, 10], 2) == 1)
print(binary_search([1, 2, 3, 10], 3) == 2)
print(binary_search([1, 2, 3, 10], 10) == 3)
print(binary_search([1, 2, 3, 10], 9) == 3)
print(binary_search([1, 2, 3, 10], 4) == 3)
print(binary_search([1, 2, 3, 10], 0) == 0)
print(binary_search([1, 2, 3, 10], 11) == 3)
print(binary_search([5, 7, 8, 10], 3) == 0)

Implement floor division (#8)