C plus plus program for linear search non-recursive method?

Answer 1

#include

#include

#include

void main(){

int arr[100],i,element,no;

clrscr();

printf("\nEnter the no of Elements: ");

scanf("%d", &no);

for(i=0;i

printf("\n Enter Element %d: ", i+1);

scanf("%d",&arr[i]);

}

printf("\nEnter the element to be searched: ");

scanf("%d", &element);

for(i=0;i

if(arr[i] == element){

printf("\nElement found at position %d",i+1);

getch();

exit(1);

}

}

printf("\nElement not found");

getch();

}

Output:

Enter the no of Elements: 5

Enter Element 1: 12

Enter Element 2: 23

Enter Element 3: 52

Enter Element 4: 23

Enter Element 5: 10

Enter the element to be searched: 23

Element found at position 2

Answer 2

Non-recursive, linear search is achieved via a standard for or while loop. In effect, you start at the beginning of the collection (whether an array or a list), and repeatedly compare elements until a match is found. If the collection is sorted, then we can also exit the loop prematurely when the current element is larger than that being sought.

Example:

#include

bool Search( const int* Array, const int Elements, const int Value, int* Index )

{

for( *Index=0; *Index

{

if( Array[*Index] == Value )

return( true );

if( Array[*Index] > Value )

return( false );

}

return( false );

}

int main()

{

const int Elements = 10;

const int Array[Elements] = {2, 4, 6, 8, 10, 12, 14, 16, 18, 20 };

int Index = 0;

printf( "Array: " );

for( ; Index

printf( "%d ", Array[Index] );

printf( "\n\n" );

for( int Value=1; Value<=20; ++Value )

{

if( Search( Array, Elements, Value, &Index ))

printf( "The value %d was found at element index %d\n", Value, Index );

else

printf( "The value %d does not exist; %d element%s checked\n", Value, Index + 1, Index?"s were":" was" );

}

return( 0 );

}

Output:

Array: 2 4 6 8 10 12 14 16 18 20

The value 1 does not exist; 1 element was checked

The value 2 was found at element index 0

The value 3 does not exist; 2 elements were checked

The value 4 was found at element index 1

The value 5 does not exist; 3 elements were checked

The value 6 was found at element index 2

The value 7 does not exist; 4 elements were checked

The value 8 was found at element index 3

The value 9 does not exist; 5 elements were checked

The value 10 was found at element index 4

The value 11 does not exist; 6 elements were checked

The value 12 was found at element index 5

The value 13 does not exist; 7 elements were checked

The value 14 was found at element index 6

The value 15 does not exist; 8 elements were checked

The value 16 was found at element index 7

The value 17 does not exist; 9 elements were checked

The value 18 was found at element index 8

The value 19 does not exist; 10 elements were checked

The value 20 was found at element index 9

Answer 3

#include<stdio.h> /*program to perform linear search*/

void main()

{

int a[5],se,i;

printf("Enter elements:");

for(i=0;i<5;i++)

{

scanf("%d",&a[i]);

}

printf("Enter search element:");

scanf("%d",&se);

for(i=0;i<5;i++)

{

if(a[i]==se)

{

printf("Element is at position number %d .\n",i+1);

}

else

printf("Invalid.\n");

}

}