Jayanti Singh BCA 3rd Semester

1. Program to sort an array using insertion sort

#include<stdio.h>
#include<conio.h>
void main()
{
int a[10],i,j,t;
clrscr();
printf("entr ele");
for(i=0;i<10;i++)
{
scanf("%d",&a[i]);
}
for(i=0;i<10;i++)
{
t=a[i];
for(j=i-1;j>=0 && t<a[j];j--)
{
a[j+1]=a[j];
a[j]=t;
}
}
printf("the inserted array is\n");
for(i=0;i<10;i++)
{
printf("%d\n",a[i]);
}
getch();
}

Output

Jayanti Singh BCA 3rd Semester

2. Program to sort an array using quick sort

#include<stdio.h>
#include<conio.h>
void qs(int a[],int low,int higgh);
void main()
{
int a[10],i;
printf("enter elements");
for(i=0;i<=9;i++)
{
scanf("%d",&a[i]);
}
printf("unsorted=");
for(i=0;i<=9;i++)
{
printf("%d",a[i]);
qs(a,0,9);
}
printf("sorted array");
for(i=0;i<=9;i++)
{
printf("%d\n",a[i]);
}
getch();
}

Jayanti Singh BCA 3rd Semester

void qs(int a[],int low,int high)

{
int i,j,x,y;
i=low,j=high;
x=a[(low+high)/2];
do
{
while((a[i]<x)&&(i<=high))i++;
while((x<a[j])&&(j>low))j--;
if(i<=j)
{
y=a[i];
a[i]=a[j];
a[j]=y;
i++;
j--;
}
}
while(i<=j);
if(low<j)
qs(a,low,j);
if(i<high)
qs(a,i,high);
}

Output

Jayanti Singh BCA 3rd Semester

3. Program to sort an array using selection sort

#include<stdio.h>
#include<conio.h>
void main()
{
int a[10],i,j,temp;

Jayanti Singh BCA 3rd Semester

clrscr();
printf("enter 10 elements");
for(i=0;i<10;i++)
{
scanf("%d",&a[i]);
}
for(i=0;i<10;i++)
{
for(j=j+1;j<10;j++)
{
if(a[j]>a[i])
{
temp=a[j];
a[j]=a[i];
a[i]=temp;
}}}
for(i=0;i<10;i++)
{
printf("%d",a[i]);
}
getch();
}

Output

Jayanti Singh BCA 3rd Semester

Jayanti Singh BCA 3rd Semester

4. Program to sort an array using merge sort

#include<stdio.h>
#include<conio.h>
int i,j;
int mg(int[],int ,int ,int );
int mr(int[],int,int);
void main()
{
int a[6];
clrscr();
printf("enter ele.");
for(i=0;i<6;i++)
{
scanf("%d",&a[i]);
}
mr(a,0,5);
//clrscr();
for(i=0;i<6;i++)
{
printf("%d\t",a[i]);
}
getch();
}
int mr(int a[],int l,int r)
{
int m;
if(l<r)
{
m=(l+r)/2;
mr(a,l,m);
mr(a,m+1,r);
mg(a,l,m,r);
}
return 0;
}
int mg(int a[],int l,int m,int r)

Jayanti Singh BCA 3rd Semester

{
int k=l;
int b[6];
i=l,j=m+1;
while((i<=m) && (j<=r))
{
if(a[i]<= a[j])
{b[k++]=a[i++];}
else
{b[k++]=a[j++];}
}
if(i<=m)
{
for( ;i<=m;i++)
{
b[k++]=a[i];
}
else
{
for( ;j<=r;j++)
{ b[k++]=a[j];
}
}
for(i=l;i<=r;i++)
{
a[i]=b[i];
}
return 0;
}

Output

Jayanti Singh BCA 3rd Semester

5. Program to sort an array using binary search

#include<stdio.h>
#include<conio.h>
int i,j;
int mg(int[],int ,int ,int );
int mr(int[],int,int);
void main()
{
int a[6];
clrscr();
printf("enter ele.");
for(i=0;i<6;i++)
{
scanf("%d",&a[i]);
}
mr(a,0,5);
//clrscr();
for(i=0;i<6;i++)
{

Jayanti Singh BCA 3rd Semester

printf("%d\t",a[i]);
}
getch();
}
int mr(int a[],int l,int r)
{
int m;
if(l<r)
{
m=(l+r)/2;
mr(a,l,m);
mr(a,m+1,r);
mg(a,l,m,r);
}
return 0;
}
int mg(int a[],int l,int m,int r)
{
int k=l;
int b[6];
i=l,j=m+1;
while((i<=m) && (j<=r))
{
if(a[i]<= a[j])
{b[k++]=a[i++];}
else
{b[k++]=a[j++];}
}
if(i<=m)
{
for( ;i<=m;i++)
{
b[k++]=a[i];
}
}
else
{
for( ;j<=r;j++)
{ b[k++]=a[j];
}
}
for(i=l;i<=r;i++)
{

Jayanti Singh BCA 3rd Semester

a[i]=b[i];
}
return 0;
}

Output

6. Program to sort an array using shell sort

#include<stdio.h>
#include<conio.h>
void main()
{
int a[50],i,j,k,temp,num;
clrscr();
printf("enter size of array\n");
scanf("%d",&num);
printf("enter elements of array\n");
for(k=0;k<num;k++)

Jayanti Singh BCA 3rd Semester

{
scanf("%d",&a[k]);
}
for(i=num/2;i>0;i=i/2)
{
for(j=i;j<=num;j++)
{
for(k=j-i;k>=0;k=k-i)
{
if(a[k+i]>=a[k])
{
break;
}
else
{
temp=a[k];
a[k]=a[k+i];
a[k+i]=temp;
}}}}
for(k=0;k<num;k++)
{
printf("%d\t",a[k]);
}
getch();
}

Output

Jayanti Singh BCA 3rd Semester

Jayanti Singh BCA 3rd Semester

7. Program to sort an array using lexical sort

#include<stdio.h>
#include<string.h>
void main()
{
int i,j;
char str[10][50],temp[50];
clrscr();
printf("Enter 10 words:\n");
for(i=0;i<10;i++)
gets(str[i]);
for(i=0;i<10;i++)
{
for(j=i+1;j<10 ;j++)
{
if(strcmp(str[i],str[j])>0)
{
strcpy(temp,str[i]);
strcpy(str[i],str[j]);
strcpy(str[j],temp);
}}}
printf("In lexicographical order: \n");
for(i=0;i<10;++i)
{
puts(str[i]);
}
getch();
}

Jayanti Singh BCA 3rd Semester

Output

Jayanti Singh BCA 3rd Semester

8. Program to sort an array using bubble sort

#include<stdio.h>
#include<conio.h>
void main()
{
int ar[10],i,j,temp;
clrscr();
printf("enter array");
for(i=0;i<=9;i++)
{
scanf("%d",&ar[i]);
}
printf("unsorted array");
for(i=0;i<=9;i++)
{
printf("%d",ar[i]);
}
printf("sorted array");
for(i=0;i<=9;i++)
{
for(j=0;j<=9;j++)
{
if(ar[j]>ar[j+1])
{
temp=ar[j+1];
ar[j+1]=ar[j];
ar[j]=temp;
}}
printf("%d\n",ar[i]);
}

Jayanti Singh BCA 3rd Semester

getch();
}

Output

Jayanti Singh BCA 3rd Semester

9. Program to sort an array using quick sort

#include<stdio.h>
#include<conio.h>
void qs(int [],int low,int high);
void main()
{
int a[10],i ;
clrscr();
printf("enter the ele");
for(i=0;i<9;i++)
{
scanf("%d",&a[i]);
}
printf("unsorted") ;
for(i=0;i<9;i++)
{
printf("%d ",a[i]);
qs(a,0,9);
}
printf("sorted") ;
for(i=0;i<9;i++)
{
printf("%d ",a[i]);
}

Jayanti Singh BCA 3rd Semester

getch();
}
void qs(int a[],int low,int high)
{
int i,j,x,y;
i=low,j=high;
x=a[(low+high)/2];
do
{
while((a[i]<x)&&(i<=h))i++;
while((x<a[j])&&(j>low))j--;
if(i<=j)
{
y=a[i];
a[i]=a[j];
a[j]=y;
i++;j--;
}
}while(i<=j);
if(low<j)
qs(a,low,j);
if(i<high)
qs(a,i,high);
}

Output

Jayanti Singh BCA 3rd Semester

10. Program to search an element using linear search

#include<iostream.h>
#include<conio.h>

Jayanti Singh BCA 3rd Semester

void main()
{
int a[100],i,n,item,s=0;
clrscr();
cout<<"\n linear search\n\n";
cout<<"enter no of elements=";
cin>>n;
cout<<"\nenter elements=\n";
for(i=1;i<=n;i++)
{
cin>>a[i];
}
cout<<"\nenter element you want to search";
cin>>item;
for(i=1;i<=n;i++)
{
if(a[i]==item)
{
cout<<"\nelement is found at location:"<<i;
s=1;
break;
}}
if(s==0)
{
cout<<"data is not found";
}
getch();
}

Output

Jayanti Singh BCA 3rd Semester