C++ Program to implement MERGE SORT

Program in c++ for  MERGE SORT...

DESCRIPTION:-  For better understanding  i am uploading a  pic which shows u step by step execution of heap sort that how it happens....

OUTPUT OF THE PROGRAM:-

SOUCE CODE:-

#include<iostream>

#include<conio .h>
using namespace std;
int main()
{
int a[5],b[5],c[10],i,j,temp;
cout<<"Array A\n";
for(i=0;i<5 data-blogger-escaped-b="" data-blogger-escaped-i="">
{
cin>>a[i];
}
cout<<"\nArray B\n";
for(i=0;i<5 data-blogger-escaped-b="" data-blogger-escaped-i="">
{
cin>>b[i];
}
cout<<"\nArray C\n";
for(i=0;i<5 data-blogger-escaped-b="" data-blogger-escaped-i="">
{
c[i]=a[i];
}
for(i=0;i<5 data-blogger-escaped-b="" data-blogger-escaped-i="">
{
c[i+5]=b[i];
}
for(i=0;i<10 data-blogger-escaped-b="" data-blogger-escaped-i="">
{
cout<
}
for(i=0;i<10 data-blogger-escaped-b="" data-blogger-escaped-i="">
{
for(j=i;j<10 data-blogger-escaped-b="" data-blogger-escaped-j="">
{
if(c[i]>c[j])
{
temp=c[i];
c[i]=c[j];
c[j]=temp;
}
}
}

cout<<"\nSorted Array is\n";
for(i=0;i<10 data-blogger-escaped-b="" data-blogger-escaped-i="">
{
cout<
}



/* IF U FOUND ANY PROBLEM IN THIS PROGRAM  OR IF YOU HAVE ANY QUERY RELATED THIS PROGRAM THEN PLEASE COMMENT IN THIS POST OR YOU CAN DIRECTLY MAIL ME ON piyushkhandelwal029@gmail.com . */

THANKU. 

SHARE

Admin

• 
• 
• 
• 
•