Linear Search

# Linear Search - int n,i,k,arr[max clrscr printf"Enter...

This preview shows pages 1–3. Sign up to view the full content.

#include<stdio.h> #include<conio.h> /* RISHI AGARWAL        LINEAR SEARCH    ROLL NO 02    SE CMPN A */ #define max 20 void display(int a[],int n) {  int i;  printf("\nLIST\n");  for(i=0;i<n;i++)  printf("%d ",a[i]); } void isort(int arr[],int n) {  int i,j,x;  for(i=1;i<=n-1;i++)  {   x=arr[i];   j=i;   {    arr[j]=arr[j-1];    j--;   }  arr[j]=x;  } } void seqsearch(int a[],int n,int k) {  int i=0;

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
i++;  if(a[i]==k)  printf("The element %d is found at position %d",a[i],i+1);  else  printf("Element Not Found"); } void main()
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: { int n,i,k,arr[max]; clrscr(); printf("Enter the no of data:"); scanf("%d",&n); printf("Enter the nos"); for(i=0;i<n;i++) scanf("%d",&arr[i]); //Displaying List display(arr,n); //Insertion Sort isort(arr,n); //Displaying Sorted List display(arr,n); printf("\nEnter the key:"); scanf("%d",&k); seqsearch(arr,n,k); getch(); } OUTPUT: Enter the no of data:6 Enter the nos2 89 44 72 56 31 LIST 2 89 44 72 56 31 LIST 2 31 44 56 72 89 Enter the key:72 The element 72 is found at position 5...
View Full Document

## This note was uploaded on 10/25/2010 for the course CMPN SEM4 taught by Professor Thakur during the Spring '07 term at University of Mumbai.

### Page1 / 3

Linear Search - int n,i,k,arr[max clrscr printf"Enter...

This preview shows document pages 1 - 3. Sign up to view the full document.

View Full Document
Ask a homework question - tutors are online