Merge sort using arrays

Posted by MindBreaker at 2:10 AM Read our previous post

Object:

Merge sort using arrays

Source Code:

#include<iostream>

#include<conio.h>

using namespace std;

class sort

{public:

void merge(int a[],int p,int q,int r)

{

int c[10];

int i=p;

int j=q+1;

int k=p;

while((i<=q)&&(j<=r))

{

if(a[i]<a[j])

{

     c[k]=a[i];

      i=i+1;

     k=k+1;

}

else

{

     c[k]=a[j];

      j=j+1;

      k=k+1;

}

}

while(i<=q)

{

     c[k] =a[i];

     i=i+1;

     k=k+1;

}

while(j<=r)

{

     c[k]=a[j];

     j=j+1;

     k=k+1;

}

int l=p;

while(l<=r)

{

a[l]=c[l];

l=l+1;

}

}

void mergesort(int a[],int p,int r)

{

     if( p < r)

    {

         int q=(p+r)/2;

         mergesort(a,p,q);

         mergesort(a,q+1,r) ;

         merge(a,p,q,r);

     }

}

////////////////////////////////////////////////////////////////////////////////////////

};

void main()

{

       sort srt;

int a[10],p,q,r,i,n;

cout<<"Enter the number of elements";

cin>>n;

p=0;

r=n-1;///////////////////////////// one less total

cout<<"Enter the array";

for(i=0;i<n;i++)

{

     cin>>a[i];

}

 srt.mergesort(a,p,r);

cout<<"The sorted array is:";

for(i=0;i<n;i++)

{

     cout<<"\n"<<a[i];

}

getch();

}

Output: