Linear Searching

C Program For Linear Search

Source Code:


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

void main()
   {
    int a[100],n,key,i,j,t;
    clrscr();
    printf("Enter no. of element");
    scanf("%d",&n);


    printf("Enter the element");
    for(i=0;i<=n-1;i++)
      {
	scanf("%d",&a[i]) ;
      }


      printf("\nUnsorted list\n");
    for(i=0;i<=n-1;i++)
     {
     printf("\t%d",a[i]);
     }


    for(i=0;i<=n-2;i++)
     {
     for(j=i+1;j<=n-1;j++)
      {
      if(a[i]>a[j])
       {
       t=a[i];
       a[i]=a[j];
       a[j]=t;
       }
      }
     }
     printf("\nsorted list\n");
     for(i=0;i<=n-1;i++)
      {
      printf("\t%d",a[i]);
      }


    printf("\nEnter element to scarch");
    scanf("%d",&key);

    for(i=0;i<=n-1;i++)
      {
	if(a[i]==key)
	  {
	    printf("Found at position %d",i+1);
	    break;
	  }
      }


	if(i==n)
	printf("Not found");
    getch();
  }

OUTPUT:

Enter no. of element5
Enter the element23                                                             
61                                                                              
58                                                                              
49                                                                              
86                                                                              
                                                                                
Unsorted list                                                                   
        23      61      58      49      86                                      
sorted list                                                                     
        23      49      58      61      86                                      
Enter element to scarch 58                                                       
Found at position 3