البحث الخطي في المصفوفات

//Linear Search of an Array
 
#include <iostream>
 
using namespace std;
int linear (int[],int,int);
 
int main()
{
	const int arraySize=100;
	int a[arraySize], searchkey, elemnt;
 
 
	for (int i=0; i<arraySize;i++)
		a[i]= 2 * i;
 
	cout<<'Enter Intergr search key:'<<endl;
	cin>>searchkey;
	elemnt=linear(a, searchkey,arraySize);
		 if(elemnt != -1)
			 cout<<'Found value in elemnt'<<endl<<elemnt<<endl;
		 else 
			 cout<<'Value not found'<<endl;
	system('pause');
	return 0;
}
 
int linear(int array[],int key,int size)
{
	for (int n=0;n <size;n++)
		if (array[n]==key)
			return n;
	return -1;
}

int linear (int[],int,int);

int a[arraySize], searchkey, elemnt;

for (int i=0; i<arraySize;i++)
		a[i]= 2 * i;

elemnt=linear(a, searchkey,arraySize);

 
int linear(int array[],int key,int size)
{
	for (int n=0;n <size;n++)
		if (array[n]==key)
			return n;
	return -1;
}