Linear Search in an Unsorted Array

C Linear search in an unsorted array.

#include < stdio.h >
#include < conio.h >

void main( )
{
int arr[10] = { 11, 2, 9, 13, 57, 25, 17, 1, 90, 3 } ;
int i, num ;

clrscr( ) ;

printf ( “Enter number to search: ” ) ;
scanf ( “%d”, &num ) ;

for ( i = 0 ; i < = 9 ; i++ )
{
if ( arr[i] == num )
break ;
}

if ( i == 10 )
printf ( "Number is not present in the array." ) ;
else
printf ( "The number is at position %d in the array.", i ) ;

getch( ) ;
}

50.

/* CH9PR2.C: Linear search in a sorted array. */

#include < stdio.h >
#include < conio.h >

void main( )
{
int arr[10] = { 1, 2, 3, 9, 11, 13, 17, 25, 57, 90 } ;
int i, num ;

clrscr( ) ;

printf ( “Enter number to search: ” ) ;
scanf ( “%d”, &num ) ;

for ( i = 0 ; i < = 9 ; i++ )
{
if ( arr[9] < num || arr[i] > = num )
{
if ( arr[i] == num )
printf ( “The number is at position %d in the array.”, i ) ;
else
printf ( “Number is not present in the array.” ) ;
break ;
}
}

getch( ) ;
}