Merge Sort [CPP]

Merge sort is sorting technique used to merge and sort two sorted lists.
If the two lists are not sorted we have to sort it before merge.

Merge Sort

Source Code

#include <iostream> using namespace std; class merge { public: void read() { long int a[100], b[100], c[100], i, j, t, n1, n2; cout<<"Enter Limit of 1st List: "; cin>>n1; cout<<"Enter Elements: "; for(i=0;i<n1;i++) { cin>>a[i]; } cout<<"Enter Limit of 2nd List: "; cin>>n2; cout<<"Enter Elements: "; for(i=0;i<n2;i++) { cin>>b[i]; } for(i=0;i<n1;i++) { for(j=i+1;j<n1;j++) { if(a[i]>a[j]) { t=a[i]; a[i]=a[j]; a[j]=t; } } } for(i=0;i<n2;i++) { for(j=i+1;j<n2;j++) { if(b[i]>b[j]) { t=b[i]; b[i]=b[j]; b[j]=t; } } } j=0; t=0; for(i=0;i<n1+n2;) { if(a[j]<b[t]) { c[i++]=a[j++]; } else { c[i++]=b[t++]; } if(j==n1||t==n2) { break; } } for(;j<n1;) { c[i++]=a[j++]; } for(;t<n2;) { c[i++]=b[t++]; } cout<<"Sored List: "; for(i=0;i<n1+n2;i++) { cout<<c[i]<<" "; } cout<<"\n"; } }; int main() { merge m; m.read(); cin.get(); }