/* Linear Search of upto 100 numbers based on  Page 63-65 of Skansholm
   developed by RJB Jan 26th 2008
*/
#include <iostream>
using namespace std;

main ()
{
   const int max_number = 101;

   int f[max_number], n = 0; //n is the number of numbers input
   cout << "Input at most 100 integers" << endl;
   cout << "and end by inputting the number you want to seach for." << endl;
   while ( n < max_number && cin >> f[n] )
      n++;

   int number = f[n-1];
   n--;
   cout << "number = "<< number <<endl;

   //Search the array 0..n-1 for the `n`th input
   int k;
   for ( k = 0; k<n && f[k]!=number; k++)
      cout << "f[" << k << "]= " << f[k] << endl;

   if (k < n)
      cout << "The number is in item number "<< k << endl;
   else
      cout <<"The number does not appear before the last item"<<endl;

}