#include <iostream>

class A {

private:

    int mid;
    int a[10];
    int low;
    int high;
    int key;

public:

    int i;

     A (int arr[10] , int l , int h ,int k){
        
        low = l;
        high = h;
        key = k;

        for (int i = 0; i < 10; ++i)
        {
            a[i]=arr[i];
        }

    }

    friend int search(A obj);
    
};

 int search(A obj){

    while(obj.low <= obj.high){

        if(obj.key == obj.a[obj.mid])
            return obj.mid;

        if (obj.key > obj.a[obj.mid])
               obj.low = obj.mid+1;
        else
            obj.high = obj.mid + 1;
    }

 }

int main(int argc, char const *argv[])
{   
    int p;
    int arr[10] = {6,8,9,12,16,18,19};
    int k = 9;

    A obj(arr,0,10,k);

    search(obj);
    
    return 0;
 }