Program 1

WAP to implement insertion sort algorithm.

Source Code:
#include<conio.h>
#include<iostream.h>
void insertion(int* a,int last)
{
int item=a[last];
for(int c=last-1;c>=0;c--)
{
if(a[c]<=item)
{
break;
}
else
{
a[c+1]=a[c];
}
}
a[c+1]=item;
}

void main()

{
clrscr();
cout<<"sorting using Insertion sort \n";
int a[10];
cout<<"Unsorted Array \n";
for(int c=0;c<10;c++)
{
cin>>a[c];
insertion(a,c);

}
cout<<"Sorted Array: \n" ;
for( c=0;c<10;c++)
{
cout<<a[c]<<"\t";
}

getch();
}

Output:

Program 2
WAP to implement s Bubble sort algorithm

Source Code:
#include<conio.h>
#include<iostream.h>
void bubble(int* a,int last)
{
for(int c=last-1;c>0;c--)
{
for(int i=0;i<c;i++)
{
if(a[i+1]<a[i])
{
Int temp=a[i+1];
a[i+1]=a[i];
a[i]=temp;
}
}
}
}

void main()
{
clrscr();
cout<<"sorting using bubble sort \n";
int a[]={5,7,1,3,9,4,6,8,2,10};
cout<<"Unsorted Array \n";

for(int c=0;c<10;c++)
{
cout<<a[c]<<"\t";
}
bubble(a,10);

cout<<"Sorted Array: \n" ;

for(int c=0;c<10;c++)
{
cout<<a[c]<<"\t";
}

getch();
}

Output:

Program 3
WAP to implement selection sort algorithm

Source Code:
#include<conio.h>
#include<iostream.h>
void selection(int* a,int last)
{
for(int c=0;c<last;c++)
{
Int min=a[c];
int index=c;
for(int i=c;i<last;i++)
{
if(a[i]<min)
{
Index=i;
Min=a[i]
}
}
Int temp=a[index];
a[index]=a[];
a[c]=temp;

}
}

void main()

{
clrscr();
cout<<"sorting using Selection sort \n";
int a[]={5,7,1,3,9,4,6,8,2,10};
cout<<"Unsorted Array \n";
for(int c=0;c<10;c++)
{
cout<<a[c]<<"\t";
}

selectionsort(a,10);

cout<<"Sorted Array: \n" ;

for(c=0;c<10;c++)
{
cout<<a[c]<<"\t";
}

getch();
}

Output:

Program 4
WAP to implement merge sort algorithm
Source Code:
#include<stdio.h>
#include<iostream.h>

#include<conio.h>
void merge(int* a,int l,int mid,int h)
{
int x=l, i=l,j=mid+1,b[10];
while(i<=mid && j<=h)
{
if(a[i]<=a[j])
{
b[x]=a[i];
i++;
x++;

}
else if(a[j]<a[i])
{
b[x]=a[j];
j++;
x++;

}
if(j>h)
{
for(int k=i;k<=mid;k++)
{

b[x]=a[k];
x++;
}

if(i>mid)
{
for(int k=j;k<=h;k++)
{
b[x]=a[k];
x++;
}

for(i=l;i<=h;i++)
{
a[i]=b[i];
}
}

void mergeSort(int* a, int l,int h)

{
if(l<h)
{

int mid=(l+h)/2;
mergeSort(a,l,mid);
mergeSort(a,mid+1,h);
merge(a,l,mid,h);
}

}
void main()
{
clrscr();
cout<<"Sorting using merge Sort : \n";
int a[]={8,6,3,5,2,1,7,9,10,4};
cout<<"Unsorted Array is : \n ";
for(int i=0;i<10;i++)
{
cout<<a[i]<<"\t" ;
}

mergeSort(a,0,9);
cout<<" sorted Array is : \n";
for(i=0;i<10;i++)
{
cout<<a[i]<<"\t" ;
}
getch();
}

Output:

Program 5
WAP to implement quick sort.
Source Code:
#include <iostream.h>
#include<conio.h>

int properPosition(int* a,int l,int h)

{

int pivot=a[l],i=l,j=h,temp;
while(i<j)
{
while(a[i] <= pivot)
{
i++;
}

while(a[j]>pivot)
{
j--;
}
if(i<j)
{
temp=a[i];
a[i]=a[j];
a[j]=temp;
}
}
a[l]=a[j];
a[j]=pivot;
return j;
}

void quickSort(int* a, int l,int h)

{
if(l<h)
{
int pivot=properPosition(a,l,h) ;
quickSort(a,l,pivot-1);
quickSort(a,pivot+1,h);
}
}

void main()
{
clrscr();
int a[]={5,4,3,6,7,8,11,12,10,9} ;
cout<<" Unsorted Array : \n";
for(int i=0;i<10;i++)
{
cout<<a[i]<<"\t";
}
cout<<"\n";
cout<<"Sorted Array using Quick Sort \n";
quickSort(a,0,9);
for(i=0;i<10;i++)
{
cout<<a[i]<<"\t";
}
getch();

Output: