//Linear Search Function	int linearsearch(int a[],int key,int size) //search function	{	    for (int i=0; i < size; i++) //loop to pass over all data in the array to find the sear	        ch key	    {	        if (a[i] == key)	            return i; //return position of search key	    }	    return -1; //return -1 to tell the user that search key isn't found	}

D main( )
	//Linear Search Algorithm	//main() function	#include <iostream>	using namespace std;	int linearsearch(int[], int, int); //function prototype	int main()	{	    int const SIZE = 100; //Defining constant for sizing array	    int a[SIZE];	    int key ; //varaible needed to recieve user input for search key	    for (int i = 0; i < SIZE; i++) //Loop to fill the array with data	    {	        a[i]= (i * 3)+5;	    }	    cout << "Enter integer: ";	    cin >> key;	    int element = linearsearch(a,key,SIZE); //variable which holds the element number of search	    key	    if (element != -1) //if element = -1 then out of array	        cout <<< "The integer is element no." << element << endl;	    else	        cout < "Value not found"<<endl;	    system("pause");	    return 0;	}