BinarySearch.py

class Inter:
    arr = [ ]
    
    def __init__(self, arr, x):
        self.arr = arr
        self.x = x
        
    def find(self, low, high):
        if low <= high:
            mid_index = ((low + high) // 2)
            mid = self.arr[mid_index]
            self.output = 'Not in list'
            
            if self.x > mid:
                self.find(mid_index + 1, high)
                
            elif self.x < mid:
                self.find(low, mid_index - 1)
                
            elif self.x == mid:
                self.output = mid_index

    def __str__(self):
        return f'element: {self.output}'

    

        
        
        
        

mass = [10, 12, 13, 16, 18, 19, 20, 21, 22, 23, 24, 33, 35, 42, 47]
print(*mass)
inter = Inter(mass, int(input('Find?\n->')))
inter.find(0, (len(mass) - 1))
print(inter)