#include<stdio.

h> int temp[50];

int i,j,k;
void mergesort(int a[],int i,int j); i=i1;
void merge(int a[],int i1,int j1,int i2,int j2); j=i2;
k=0;
int main() while(i<=j1 && j<=j2)
{ {
int a[30],n,i; if(a[i]<a[j])
printf("Enter no of elements:"); temp[k++]=a[i++];
scanf("%d",&n); else
printf("Enter array elements:"); temp[k++]=a[j++];
for(i=0;i<n;i++) }
scanf("%d",&a[i]); while(i<=j1)
mergesort(a,0,n-1); temp[k++]=a[i++];
printf("\nSorted array is :"); while(j<=j2)
for(i=0;i<n;i++) temp[k++]=a[j++];
printf("%d ",a[i]); for(i=i1,j=0;i<=j2;i++,j++)
return 0; a[i]=temp[j];
} }

void mergesort(int a[],int i,int j)

{
int mid;
if(i<j)
{
mid=(i+j)/2;
mergesort(a,i,mid);
mergesort(a,mid+1,j);
merge(a,i,mid,mid+1,j); sorted sub-arrays
}
}

void merge(int a[],int i1,int j1,int i2,int j2)

{
LINEAR SEARCH BINARY SEARCH
#include <stdio.h> #include <stdio.h>
int main() int main()
{
{
int c, first, last, middle, n, search,
int array[100], search, c, n; array[100];

printf("Enter number of elements\n");

printf("Enter number of elements in
scanf("%d", &n);
array\n");
scanf("%d", &n); printf("Enter %d integers\n", n);

for (c = 0; c < n; c++)

printf("Enter %d integer(s)\n", n); scanf("%d", &array[c]);

for (c = 0; c < n; c++) printf("Enter value to find\n");

scanf("%d", &search);
scanf("%d", &array[c]);
first = 0;
printf("Enter a number to search\n"); last = n - 1;
middle = (first+last)/2;
scanf("%d", &search);
while (first <= last) {
for (c = 0; c < n; c++) if (array[middle] < search)
first = middle + 1;
{
else if (array[middle] == search) {
if (array[c] == search) /* If required printf("%d found at location %d.\n",
element is found */ search, middle+1);
break;
{
}
printf("%d is present at location else
%d.\n", search, c+1); last = middle - 1;
break;
middle = (first + last)/2;
}
}
} if (first > last)
if (c == n) printf("Not found! %d isn't present in
the list.\n", search);
printf("%d isn't present in the array.\n",
search); return 0;
}
return 0;
}