[pedrowong]

#include <stdio.h>
#include <stdlib.h>
#include <time.h>
#define SIZE 8; //暫設大小為8

void merge(int *data[], int length);
void mergesort(int *data[], int left, int mid, int right);

void main(void)
{
int data[] = {5,1,7,50,10,4,80,33};
int i = 0;
int length = SIZE;

srand(time(NULL));

printf("陣列大小:%d \n", length);
printf("原陣列:");
for(i = 0; i < length; i ++){//亂數產生放入陣列中
//data[i] = rand();
printf("%d ", data[i]);
}

merge(&data, length);
printf("\n排列後之陣列:");
for(i = 0; i < length; i ++){
printf("%d ", data[i]);
}
system("pause");
return;
}



void merge(int *data[], int length)
{
int count = 0, size = 1;//分割用
int left = 0, right = 0, mid = 0; //指標用

while(count < 5){
while(1){
mid = (left + size)-1;
right = (mid + size);
if(length <= right){
right = length - 1;
if(right <= mid){break;}
}

mergesort(data, left, mid, right);
left = right + 1;
printf("\n%d %d", right, mid);
}
count += 1;
size *= 2;
}

}

void mergesort(int *data[], int left, int mid, int right)
{
int temp[8];
int i = 0, j = left, k = left;

while(j<=mid){
temp[i] = data[j];
i++;
j++;
}
i = 0;
while(j <= right){
if(temp[i] <= data[j]){
data[k] = temp[i];
k ++;
i ++;
}else{
data[k] = data[j];
k ++;
j ++;
}
}
while (k < j){
data[k] = temp[i];
k = k+1; i = i+1;
}
}