// ************************      linearSearch.C      ************************

template < class LE >
int linearSearch ( LE keyList [], int numKeys,
                   LE searchKey,  int &index    )
{
   int result;                                           // result returned

   index = 0;
   while ( index < numKeys  &&  searchKey > keyList[index] )
         index++;

   if ( index < numKeys  &&  searchKey == keyList[index] )
      result = 1;                                        // searchKey found
   else
   {
      index--;                                           // searchKey not found
      result = 0;
   }

   return result;
}

// ************************      unknownSearch.C      ************************

template < class LE >
int unknownSearch ( LE keyList [], int numKeys,
                    LE searchKey,  int &index )
{
    int result;                                         // result returned

    index = 0;
    while ( index < numKeys  &&  searchKey != keyList[index] )
          index++;

    if ( index < numKeys )
       result = 1;                                       // searchKey found
    else
    {
       index--;                                          // searchKey not found
       result = 0;
    }

    return result;
}