Simple Insertion Sort technique
void main()
{
int i,j,arr[100],temp=0;
cout<<"###INSERTION SORT###\n\n";
cout<<"Enter The Elements"<<endl;
for(i=0;i<5;i++)
{
cin>>arr[i];
}
cout<<"\n\nEntered Elements are"<<endl;
for(i=0;i<5;i++)
{
cout<<arr[i]<<",";
}
for(i=0;i<5;i++)
{
for(j=0;j<5-i;j++)
{
while(arr[j]<arr[j-1])
{
temp=arr[j-1];
arr[j-1]=arr[j];
arr[j]=temp;
}
}
}
cout<<"\n\nSorted Elements are"<<endl;
for(i=0;i<5;i++)
{
cout<<arr[i]<<",";
}
getch();
}
{
int i,j,arr[100],temp=0;
cout<<"###INSERTION SORT###\n\n";
cout<<"Enter The Elements"<<endl;
for(i=0;i<5;i++)
{
cin>>arr[i];
}
cout<<"\n\nEntered Elements are"<<endl;
for(i=0;i<5;i++)
{
cout<<arr[i]<<",";
}
for(i=0;i<5;i++)
{
for(j=0;j<5-i;j++)
{
while(arr[j]<arr[j-1])
{
temp=arr[j-1];
arr[j-1]=arr[j];
arr[j]=temp;
}
}
}
cout<<"\n\nSorted Elements are"<<endl;
for(i=0;i<5;i++)
{
cout<<arr[i]<<",";
}
getch();
}