//this program demostrates the linear search algorithm.
#include <iostream>
using namespace std;
 
 //function prototype
 int linearSearch(const int[], int, int);
 
 int main()
 {
 	const int SIZE = 5;
 	int tests[SIZE] = { 87, 75, 98, 100, 82 };
 	int results;
 	
 	//search the array for 100.
 	results = linearSearch(tests, SIZE, 100);
 	
 	//if linearSearch returned -1, then 100 was not found.
 	if (results == 1)
 		cout << "You did not earn 100 points on any test\n";
 	else 
 	{
 		//otherwise results contains the subscript of
 		// the first 100 in the array.
 		cout << "You earned 100 points on test ";
 		cout << (results + 1) << endl;
	 }
	 return 0;
 }
 
 //******************************************************************
 // the linearSearch function performs a linear search on an		*
 // integer array. The array arr, which has a maximum of size		*
 // elements, is searched for the number stored in value . if the 	*
 // number is found, its array subscript is returned. otherwise, 	*
 // -1 is returned indicating the value was not in the array.		*
 //******************************************************************
 
int linearSearch(const int arr[], int size, int value)
{
	int index = 0;			//used as a subscript to search array
	int position = -1;		//to record position of the search value
	bool found = false;		//falg to indicate if the value was found
	
	while (index < size && !found )
	{
		if (arr[index] == value)	//if the value is found
		{
			found = true;			//set the flag
			position = index;		//record the value's subscript
		}
		index++;					//go to the next element
	}
	return position;				//return the position, or -1
}