Re: binary search on array based list

I'm sorry guys; could anyone spell this out to me like I'm a ten year
old. I dont understand operator overloading and when you say reading
the list, do I just use a for loop to read the list and then implement
the comparisons?
<code>
#include <iostream>
#include <fstream>

const int MAX_LENGTH = 10;

using namespace std;

class IntList
{
      public:
             IntList();
             void GetList(ifstream &data);
             void PrintList();
             int LengthIs();
             int operator[](int mid);
      private:

              int length;
              int values[MAX_LENGTH];
};

bool BinarySearch(IntList *, int , int , int ,bool);

int main()
{
    ifstream inData;
    IntList values;
    int item,fromLoc,toLoc,istep=0;
    bool found = true;
    char answer;

    string msg = "Number out of range! ";
    inData.open("int.dat");
    do{
        cout << fixed << showpoint;
        cout << "Enter value to be searched for: "<< endl;
        cin >> item;
        cout << "Enter starting location in 0-9 range: "<< endl;
        cin >> fromLoc;
        cout << "Enter end location in 0-9 range: "<< endl;
        cin >> toLoc;
        try{
             while(istep != MAX_LENGTH)
             {
                 if((fromLoc <= 9) && (fromLoc >=0)&&(toLoc <= 9) &&
(toLoc >=0) && (fromLoc<toLoc))
                 { cout << "Correct range! Do the search." <<endl;
                     BinarySearch(values,item,fromLoc,toLoc,found);
                     istep++;
                     cout << "This is the " << istep <<"th iteration,
do you want to continue? <Y/N> ";
                     cin >> answer;
                     if(answer == 'n')
                     { cout << "Search abrted!";
                         cout << "There were " << istep << "
iterations.";
                        break;
                     }
                 }
                 else
                       throw msg;

             }
        }
        catch(string message)
        {
           cout << message << "Search aborted!";

        }
        break;

    }while(found = false);

    cout << endl;
    cout << "*******************************************************"
<< endl;

    values.GetList(inData);
    cout << "The list is : ";
    values.PrintList();
    cout << endl;
    cout << "Length is " << values.LengthIs() << endl;
    cout << "*******************************************************"
<< endl;
    system("pause");
    return 0;

}

IntList::IntList()
{
  length =0;
}

void IntList::GetList(ifstream &data)
{
     int value;

     data >> value;

     while(data)
     {
       for(int i=0;i<MAX_LENGTH;i++)
       {
          data >> value;
          values[i] = value;
          length++;
       }
       cout << "List has been populated." << endl;
     }

}

void IntList::PrintList()
{
     int index;
     for(index=0;index<MAX_LENGTH;index++)
     {
       cout << values[index]<< " ";
     }
}

int IntList::LengthIs()
{
     return length;
}
bool BinarySearch(const IntList &values, int item, int first, int
last,bool found)
{

     found = false;
     int num = 1;
     while(first <= last)
     {
       int mid = (first + last) / 2;

       if(item > values[mid])
          first = mid +1;
       else if(item < values[mid])
            last = mid - 1;
       else

           return found = true;
        }

     return found = false;
}

</code>

139 C: passing `const IntList' as `this' argument of `int
IntList::operator[](int)' discards qualifiers