#include <stdio.h>
#define LEN 8
int a[LEN] = { 8, 7, 6, 5, 4, 3, 2, 1 };
void merge(int start, int mid, int end)
{
int n1 = mid - start + 1;
int n2 = end - mid;
int left[n1], right[n2];
int i, j, k;
for (i = 0; i < n1; i++)
left[i] = a[start+i];
for (j = 0; j < n2; j++)
right[j] = a[mid+1+j];
i = j = 0;
for (k = start; i < n1 && j < n2; k++) {
if (left[i] < right[j]) {
a[k] = left[i];
i++;
}
else {
a[k] = right[j];
j++;
}
}
if (i < n1)
for (; i < n1;i++){
a[k] = left[i];
k++;
}
if (j < n2)
for (; j < n2;j++){
a[k] = right[j];
k++;
}
}
void sort(int start, int end)
{
int mid;
if (start < end) {
mid = (start + end) / 2;
printf("sort (%d-%d, %d-%d) %d %d %d %d %d %d %d %d\n",
start, mid, mid+1, end,
a[0], a[1], a[2], a[3], a[4],
a[5], a[6], a[7]);
sort(start, mid);
sort(mid + 1, end);
merge(start, mid, end);
printf("merge (%d-%d, %d-%d) to %d %d %d %d %d %d %d %d\n",
start, mid, mid+1, end,
a[0], a[1], a[2], a[3], a[4],
a[5], a[6], a[7]);
}
}
int main(void)
{
sort(0, LEN-1);
return 0;
}
sort (0-3, 4-7) 8 7 6 5 4 3 2 1
sort (0-1, 2-3) 8 7 6 5 4 3 2 1
sort (0-0, 1-1) 8 7 6 5 4 3 2 1
merge (0-0, 1-1) to 7 8 6 5 4 3 2 1
sort (2-2, 3-3) 7 8 6 5 4 3 2 1
merge (2-2, 3-3) to 7 8 5 6 4 3 2 1
merge (0-1, 2-3) to 5 6 7 8 4 3 2 1
sort (4-5, 6-7) 5 6 7 8 4 3 2 1
sort (4-4, 5-5) 5 6 7 8 4 3 2 1
merge (4-4, 5-5) to 5 6 7 8 3 4 2 1
sort (6-6, 7-7) 5 6 7 8 3 4 2 1
merge (6-6, 7-7) to 5 6 7 8 3 4 1 2
merge (4-5, 6-7) to 5 6 7 8 1 2 3 4
merge (0-3, 4-7) to 1 2 3 4 5 6 7 8