MergeSort

#define _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
#include <stdlib.h>
#include <malloc.h>
#include <assert.h>
#include <string.h>

void MergeData(int* array,int left,int mid,int right,int* temp)
{
int begin1 = left, end1 = mid;
int begin2 = mid, end2 = right;
int index = left;
while (begin1 < end1&&begin2 < end2)
{
if (array[begin1] < array[begin2])
temp[index++] = array[begin1++];
else
temp[index++] = array[begin2++];
}
while (begin1 < end1)
temp[index++] = array[begin1++];
while (begin2 < end2)
temp[index++] = array[begin2++];
}
void _MergeSort(int* array,int left,int right,int* temp)
{
if (right - left>1)
{
int mid = left + ((right - left) >> 1);
_MergeSort(array, left, mid, temp);
_MergeSort(array, mid, right, temp);
MergeData(array, left, mid, right, temp);
memcpy(array+left, temp+left, sizeof(int)*(right - left));
}

}
void MergeSort(int* array, int size)
{
int* temp = (int*)malloc(sizeof(int*)size);
{
if (NULL == temp)
assert(0);
return;
}
_MergeSort(array, 0, size, temp);
free(temp);
}
void PrintArray(int array, int size)
{
for (int i = 0; i < size; ++i)
printf("%d “, array[i]);
printf(”\n");
}
int main()
{
int array[10] = { 7, 5, 3, 9, 1, 4, 6, 2, 8, 0 };
//PrintArray(array, sizeof(array) / sizeof(array[0]));
MergeSort(array, sizeof(array) / sizeof(array[0]));
PrintArray(array, sizeof(array) / sizeof(array[0]));
system(“pause”);
return 0;
}