Simple_Binary_search

# Binary search in Python list using recursion
#This is the vector that the algorithm will use to find any data
vector = [1, 2, 3, 10, 50, 80, 120, 150, 500, 1000]
print ("Let's look in the following list:", vector)
#The "search" variable will be the start of the vector, which is 0
search = 0
#We ask the user for an integer entry
number = float (input ("Enter the data you want to find:"))
def binary_recursive_search (vector, number, left, right):
    if left > right:
        return -1
    IndexMiddleItem = (left + right) // 2
    middle_item = vector [IndexMiddleItem]
    if  middle_item == number:
        return IndexMiddleItem
    if number < middle_item:
        return  binary_recursive_search (vector, number, left, IndexMiddleItem - 1)
    else:
        return  binary_recursive_search (vector, number, IndexMiddleItem + 1, right)
#The index is equal to the "vector" list, the number of the list, the length of the list.
index = binary_recursive_search (vector, number, 0, len (vector) - 1)
print ("The data {} is in the index {}". format (number, index+1))
print ("*****************************************************************************************************")