/*
 **************************************************************************
 * Program name : 042_Linear_search (Version 1.00)                        *
 * Author       : Duck Wong                                               *
 * Language     : C / C++                                                 *
 * Compiler     : Boodshed Dec-C++ compiler Ver 3.95                      *
 * Computer     : PII350                                                  *
 * O/S          : Windows 98                                              *
 **************************************************************************
 * Version 1.00 : 2000/06/26 - first version                              *
 **************************************************************************
 * Description  : (a) Generate a list of integer numbers                  *
 *                (b) Input an integer number                             *
 *                (c) List of numbers in unsorted order                   *
 *                (d) Is the inputted number in the array ?               *
 *                (e) Try again ?                                         *
 **************************************************************************
*/
#include <iostream.h>
#include <stdlib.h>
#include <iomanip.h>
#include <time.h>

const int Arraysize = 15;
int   Intarray[Arraysize];

void  getnumbers(int Intarray[])                                     // Note (1)
{
 int Index_1, Index_2;

 for (Index_1=0; Index_1<Arraysize; Index_1++)
   {
    Intarray[Index_1] = rand() % 50 + 1;
    if (Index_1>0)
      for (Index_2=0; Index_2<Index_1; Index_2++)
        if (Intarray[Index_1]==Intarray[Index_2])
          {
           Index_1--;
           break;
          }
   }
}

void searchnumber(int Intarray[], int Yournumber)                    // Note (2)
{
 int  Index;
 char Found;

 Found = 'N';
 for (Index=0; Index<Arraysize; Index++)
   {
    if (Intarray[Index]==Yournumber)
      {
       Found = 'Y';
       break;
      }
   }
 if (Found=='Y') cout << "\n\n\tThat's great! Your number is in the list.";
 else cout << "\n\n\tSorry your number is not in the list.";
}

int main()
{
 // part 1 : declaration
 int   Index;                        // loop counter
 int   Yournumber;                   // Inputted by the user.
 const int Arraysize=15;             // Maximum no. of element 15
 int   Intarray[Arraysize];          // Define the array Number
 char  Again;                        // Try again ?

 do {
     srand(time(NULL));
     // part 2 : Generate a list of integer numbers
     getnumbers(Intarray);

     // part 3 : Input an integer number
     cout << "\n\tThere are 15 integer numbers selected from 1 to 50."
          << "\n\tPlease enter any number within 1 to 50, then this program"
          << "\n\twill compare your number with these selected numbers.\n";
     do {
         cout << "\n\t\tYour number is : ";
         cin  >> Yournumber;
        } while ((Yournumber<1) || (Yournumber>50));

     // part 4 : List of numbers in unsorted order
     cout << "\n\tThe unsorted list is : \n\t";
     for (Index=0; Index<Arraysize; Index++)
       {
        cout << Intarray[Index];
        if (Index<(Arraysize-1)) cout << ", ";
       }

     // part 5 : Is the inputted number in the array ?
     searchnumber(Intarray,Yournumber);

     // part 6 : try another number ?
     cout << "\n\n\t\aTry another number (Y/N) : ";
     cin  >> Again;
     cout << "\n";
    }while (Again=='Y' || Again=='y');
 cout << "\n" << endl;

 system("PAUSE");
 return 0;
}

/* Note
   (1) Generates a list of integer numbers and stores these numbers in an array.
   (2) Use Linear search (Sequential search) method to seek the inpuuted number
       in the array.
*/