To Implement Merge Sort Program using C++ | Data Structures Lab Programs

#include #include class MerSort { public: int a[25],b[25],n; void merge_split(int a[],int first,int last); void merge(int a[],int f1,int l1,int f2,int l2); }; void MerSort :: merge_split(int a[],int first,int last) { int mid; if(first>obj.n; cout<<"\nEnter the elements\n"; for(i=0;i>obj.a[i]; obj.merge_split(obj.a,0,obj.n-1); cout<<"\n\nSorted list : "; for(i=0;i

SAMPLE INPUT AND OUTPUT:

Enter the limit : 5
Enter the elements
5
4
3
2
1

Sorted list:
1
2
3
4
5

⇓Student Projects⇓

⇑Student Projects⇑