2013年9月28日17:54:59 code ··· merge sort ····

//#include "mergeSort.h"
#include <iostream>
#include <stdio.h>
#include <stdlib.h>
#include <time.h>
using namespace std;
void my_Merge(int * A,int left,int mid,int right)
{
int l1 = mid-left+1;
int l2 = right-mid;
int i1 = 0;
int i2 = 0;
int iq = left;
int * lft = new int [l1+1];
int * rt = new int [l2+1];
lft[l1] = 99999;
rt[l2] = 99999;
int a;
for(int i = 0;i<l1;++i)
{
a = lft[i] = A[left+i];
}


for(int j = 0;j<l2;++j)
{
a = rt[j] = A[mid+1+j];
}
while(i1<l1 && i2<l2)
{
int a = lft[i1];
int b = rt[i2];
if(lft[i1]<rt[i2])
{
a = A[iq++]=lft[i1++];
}
else
{
a = A[iq++] = rt[i2++];
}
}
// if iq has the value ?? 
while (i1<l1)
{
a = A[iq++] = lft[i1++];
}


    while (i2<l2)
{
a = A[iq++] = rt[i2++];
}
}


void Merge_Sort(int* A,int p,int r)
{
if(p < r ){
int q = (p+r)/2;
Merge_Sort(A,p,q);
Merge_Sort(A,q+1,r);
my_Merge(A,p,q,r);
}
}




#define N 100
int main()
{
srand(time(NULL));
//int a[N] = {1,3,5,7,9};
// int a[N] = {1,3,233,7,9,2,4,6,8,10};


int a[N] = {1,3,233,7,9,1,3,233,7,9};


for(int i = 0;i<N;++i)
{
a[i] = rand()%1000;
}
Merge_Sort(a,0,N-1);


for(int i = 0;i<N;++i)
{
printf("%d ",a[i]);
}
cout << endl;


cout << "==================================="<<endl;


system("pause");
return 0;
}