الفريق العربي للهندسة العكسية

 
[align=left]#include <iostream>

using namespace std;


int LinearSearch(int Arr[], int Key, int N) {

int i;

for (i = 0 ; i < N ; i++){
    if (Arr[i] == Key)
        return i;
}


return -1;

}



int main()
{
const int Size = 10;
int List[Size] = {2,65,43,6,78,6,7,89,100,34};
int Result ,Key = 1232;

for (int i = 0; i < Size; i++)
    cout << List[i] << " ";

cout << endl;

Result = LinearSearch(List,Key,Size);

if (Result != -1)
    cout << "The Value " << Key << " Stored in Location " << Result << endl;

else {
     cout << "No Value in This Array ";
}


    return 0;
}[/align]