// display results
if ( element != -1 )
cout << "Found
value in element " << element << endl;
else
cout << "Value
not found" << endl;
return 0; // indicates successful termination
} // end main
// compare key to every element of
array until location is
// found or until end of array is
reached; return subscript of
// element if key or -1 if key not
found
int linearSearch( const int
array[], int key, int sizeOfArray )
{
for ( int j = 0; j < sizeOfArray; j++ )
if ( array[ j ] == key ) // if found,
return j; // return location of key
return -1;
// key not found
} // end
function linearSearch