/*
   testsearch1.cpp
   CIS 150
   David Klick
   6/28/05
   
   Demonstration of linear search.
*/

#include <iostream>
#include <cstdlib>
#include <ctime>
using std::cout;

const int ARRAY_SIZE = 10;

int lsearch(int n[], int len, int key);

int main(void) {
   int nums[ARRAY_SIZE];
   int i, val, pos;

   // randomize random number generator
   srand(time(NULL));
   
   // fill array up with random ints (0-99)
   for (i=0; i<ARRAY_SIZE; i++) {
      nums[i] = rand() % 100;
   }
   
   // display array
   for (i=0; i<ARRAY_SIZE; i++) cout << nums[i] << ' ';
   cout << '\n';
   
   // search for 10 random values
   for (i=0; i<10; i++) {
      val = rand() % 100;
      pos = lsearch(nums, ARRAY_SIZE, val);
      if (pos != -1) {
         cout << val << " found at position " << pos << '\n';
      } else {
         cout << val << " not found\n";
      }
   }
   
   return 0;
}

/*
   lsearch(int n[], int len, int key)
   
   performs linear search of array n[] for value: key
   len must be set to size of n[] array
   the array values do NOT have to be in sorted order
   
   returns position where key value was found in n[]
   returns -1 if key value not found in n[]
*/
int lsearch(int n[], int len, int key) {
   int i;
   for (i=0; i<len; i++) if (n[i] == key) return i;
   return -1;
}

/*
   Sample output
   
   11 73 65 83 66 81 27 32 70 60
   72 not found
   91 not found
   58 not found
   65 found at position 2
   36 not found
   44 not found
   98 not found
   80 not found
   83 found at position 3
   89 not found
*/