归并排序

1：归并排序的原理概括为将两个有序数进行排序，所以给定一个很长的数据序列，如何将其拆分两两的有序数就是解决问题的关键，此时就用到了递归和分治的思想去拆分数据，排序，在组合数据，排序。

#include"stdio.h"
void merge(int table[],int left,int medium,int right)
{
   printf("merge left = %d , right = %d, medium = %d\n", left, right, medium);
   int tmpArray[8]; //定义一个数据的临时缓存区
   int i = left;
   int j = medium + 1;
   int t = 0;
   while(i <= medium && j <= right){
       if(table[i] < table[j]){
      tmpArray[t++] = table[i++];             
    }
       else{
         tmpArray[t++] = table[j++];
       }
   }
      while(i <= medium){
         tmpArray[t++] = table[i++];
      }
      while(j <= right){
         tmpArray[t++] = table[j++];
      }
   t = 0;
   while(left <= right){
     table[left] = tmpArray[t++];
     printf("left =%d table[left] = %d\n",left,table[left]) ;
    left++;
   }
}

void sort0(int table[], int left, int right)
{
   if(left < right){
 
      int medium = (left + right) / 2;
      printf("test01 left = %d , right = %d, medium = %d\n", left, right, medium);
      sort0(table, left, medium);
      printf("test02\n");
      sort0(table,medium + 1, right);
      printf("test03\n");
      merge(table,left,medium,right);
   }
}

void sort(int table[])
{
  sort0(table, 0, 7);
}

int main()
{
   int array[8] = {10,4,5,7,1,3,8,2};
   sort(array);
   int i = 0;
   for(i = 0;i<8;i++)
   {
   printf("%d\n",array[i]) ;
   }
   printf("test");
}