Sunday, 31 August 2014

C++ program to implement bubble sort and selection sort

C++ program to implement bubble sort  and selection sort: A simple data structure program which implement the sorting technique .Sorting techniques are bubble sort and selection sort.





C++ program to implement bubble sort  and selection sort




C++ program to implement bubble sort  and selection sort

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

void main()
{
clrscr();
int ch;
int i,j,x,k,z,l,m,n,o,p,a[50],small;
q :
cout<<"Enter the choice 1:Selection  2:Bubble 3:Exchange Selection  4:Insertion 5:Exit"<<endl;
cin>>ch;
switch(ch)
{
case 1:
cout<<"Enter the limit "<<endl;
cin>>n;
cout<<endl;
cout<<"Enter the elements"<<endl;

for(i=0;i<n;i++)
   {
   cin>>a[i];
   cout<<endl;
   }

for(j=0;j<n;j++)
   {
   small=a[j];
   p=j;
 for(i=j;i<n;i++)
    {
    if(small>a[i])
    {
    small=a[i];
    p=i;
    }
    }
    for(k=p;k>j;k--)
   {
   a[k]=a[k-1];
   }
   a[j]=small;
   }
cout<<"Result"<<endl;
  for(z=0;z<n;z++)
  {
  cout<<a[z];
  cout<<endl;
  }
  goto q;
  case 2:
cout<<"Enter the limit"<<endl;
cin>>n;
cout<<"Enter the elements"<<endl;
  for(i=0;i<n;i++)
  cin>>a[i];
for(j=0;j<n;j++)
  {
  for(i=0;i<n-1;i++)
   {
   if (a[i]>a[i+1])
   {
   x=a[i+1];
   a[i+1]=a[i];
   a[i]=x;
   }
  }
  }
cout<<"Result"<<endl;
  for (i=0;i<n;i++)
   {
   cout<<a[i];
   cout<<endl;
   }
 break;
 case 3 :
cout<<"Enter the limit "<<endl;
cin>>n;
cout<<endl;
cout<<"Enter the elements"<<endl;

for(i=0;i<n;i++)
   {
   cin>>a[i];
   cout<<endl;
   }

for(j=0;j<n;j++)
   {
   small=a[j];
   p=j;
 for(i=j;i<n;i++)
    {
    if(small>a[i])
    {
    small=a[i];
    p=i;
    }
    }
   a[p]=a[j];
   a[j]=small;
   }
cout<<"Result"<<endl;
  for(z=0;z<n;z++)
  {
  cout<<a[z];
  cout<<endl;
  }
  goto q;

case 4 :
 int m=-32767;
  cout<<"enter the no. of elements"<<endl;
  cin>>n;
  cout<<"enter the array"<<endl;
  for(i=1;i<=n;i++)
  {cin>>a[i];}
  a[0]=m;
  for(i=1;i<=n;i++)
  {for(j=0;j<i;j++)
  {if(a[i]<a[j])
  {p=a[i];
  for(k=i-1;k>=j;k--)
  {a[k+1]=a[k];}
  a[j]=p;}}}
  for(i=1;i<=n;i++)
  {cout<<a[i];}
  goto q;

case 5:
exit(0);
default:
cout<<"Wrong choice";
goto q;

}
getch();
}