class ListCompresnsion(object):

    def __init__(self, a, b):
        """
        this function takes in list length and step(difference between consecutive values and process a list)
        """

        self.a = a
        self.b = b

        self.my_list =[]
        """
        processing a list
        """
        list_length = range(a, (a * b))

        for value in list_length:
            my_list.append(value)

class  BinarySearch(ListCompresnsion):


    pass
@@ -464,8 +464,977 @@
     
-pass
+BinarySearch.__init__(self)%0A    %22%22%22%0A    this class takes the list processed from the parent class to search for the desired value%0A    %22%22%22%0A    def search(self, desired_value):%0A      %0A        %22%22%22%0A        this function takes in a list and the desired, searches the desired value and return the number of interation to get the desired value and the index of the value %0A        %22%22%22%0A%0A        start = 0%0A        last = len(self.my_list) - 1%0A        count = 0%0A        out_dict = %7B%7D%0A%0A        while start %3C= last:%0A            mid_point = start + last // 2%0A            count += 1%0A%0A            if self.my_list%5Bmid_point%5D == desire_value:%0A                %22%22%22%0A                compares the mid point value and the desired value%0A                  %22%22%22%0A                index = %5Bmid_point%5D%0A                break%0A%0A%0A            else:%0A                if desire_value %3C self.my_list%5Bmid_point%5D:%0A                    last = mid_point - 1%0A%0A        out_dict%5Bcount%5D = index%0A        return out_dict %0A%0A%0A%0A

add a function that process a list to search desired value