Fibonacci Search-C++

 #include<iostream.h>  
 #include<conio.h>  
 class fibonacci  
 {  
      private:  
           int f, a, b, c, x[20], d, i, low, high, mid, n;  
      public:  
           fibonacci( );  
           void get( );  
           void fibo( );  
           void fibosearch( );  
 };  
 fibonacci :: fibonacci( )  
 {  
      a=-1;  
      b=1;  
      low=0;  
 }  
 void fibonacci :: fibo( )  
 {  
      cout<<”\nEnter the limit for Fibonacci Series : “;  
      cin>>n;  
      cout<<”\nFIBONACCI SERIES is “  
      for(i=0; i<n; i++)  
      {  
           c=a+b;  
           cout<<’\t’<<c;  
           x[i]=c;  
           a=b;  
           b=c;  
      }  
 }  
 void fibonacci :: fibosearch( )  
 {  
      high=n;  
      while(low<=high)  
      {  
           mid=(low+high)/2;  
           if(d<x[mid])  
                high=mid-1;  
           else if(d>x[mid])  
                low=mid+1;  
           else  
           {  
                f=1;  
                break;  
           }  
      }  
      if(f==1)  
           cout<<”\nElement Found in “<<mid<<” position”;  
      else  
           cout<<”\nElement Not Found”;  
 }  
 void fibonacci :: get( )  
 {  
      cout<<”\nEnter the element to be searched : “;  
      cin>>d;  
 }  
 void main( )  
 {  
      clrscr( );  
      fibonacci fib;  
      fib.fibo( );  
      fib.get( );  
      fib.fibosearch( );  
      getch( );  
 }