Analyze the following program, which searches the array linearly to find a certain valve in the array. Go through the program and write a summary about the search procedure

// Linear search of an array

#include "stdafx.h"

#include

using namespace std;

int linearSearch( const int [], int, int );

int main()

{

const int arraySize = 100;

int a[ arraySize ], searchKey, element;

for ( int x = 0; x

a[ x ] = 2 * x;

cout

cin >> searchKey;

element = linearSearch( a, searchKey, arraySize );

if ( element != -1 )

cout

else

cout

return 0; }

int linearSearch( const int array[], int key, int sizeOfArray )

{

for ( int n = 0; n

if ( array[ n ] == key )

return n;

return -1; }

/ Linear search of an arrav #include "stdats +' #include +' using namespace std int int [], int, int) int main+ const int attaxS1ZB = 100:+' int al acraxSize ], searchkev, element;* for ( int x = 0; x gttay.Sizei x++) // create some data- a[ x ] = 2 * x:- sout