Merge Sort

#include <iostream.h>
#include <conio.h>
#define MAX 10
static int merge_arr[MAX+MAX],sort_arr[MAX+MAX];
class mergesort{
int arr1[MAX],arr2[MAX],n1,n2,n3;
public:
void getdata();
void showdata(int);
void mergeLogic();
void sortLogic();
};
void mergesort :: getdata(){
int i;
cout<<”\n–Data Must be Entered in Sorted Order for each Array–\n\n”;
cout< Array: “;
cin>>n1;
for(i=0;i>arr1[i];
cout< Array: “;
cin>>n2;
for(i=0;i>arr2[i];
n3=n1+n2;
}
void mergesort :: showdata(int select){
int i;
if(select==1){
cout<<”\n\n–Array 1–\n”;
for(i=0;i<n1;i++)
cout<<arr1[i]<<” “;
}
else if(select==2){
cout<<”\n\n–Array 2–\n”;
for(i=0;i<n2;i++)
cout<<arr2[i]<<” “;
}
else if(select==3){
cout<<”\n\n–Sorted Array–\n”;
for(i=0;i<n3;i++)
cout<<sort_arr[i]<<” “;
}
}
void mergesort :: mergeLogic(){
int i,j,c;
for(i=0;i<n1;i++)
merge_arr[i] = arr1[i];
for(j=i,c=0;j<n3;j++,c++)
merge_arr[j] = arr2[c];
}
void mergesort :: sortLogic(){
//before sort [...]

Read Full Post »