C语言学习13

快速排序

 //快速排序
 #include <stdio.h>

 void quicksort(int a[], int left, int right);

 void main()
 {
     int a[] = {, , , , , , , , , };
     int i;
     printf("初始排序: \n");
     for(i = ; i < ; i++)
     {
         printf("    %d", a[i]);
     }
     quicksort(a, , );
     printf("\n快速排序后的结果:\n");
     for(i=; i<; i++)
     {
         printf("    %d", a[i]);
     }
     printf("\n");
 }

 void quicksort(int a[], int left, int right)
 {
     int j = left, k = right, temp, point;

     point = a[(left + right) / ];

     while(j <= k)
     {
         while(a[j] < point)
         {
             j++;
         }
         while(a[k] > point)
         {
             k--;
         }
         if(j <= k)
         {
             temp = a[j];
             a[j] = a[k];
             a[k] = temp;
             j++;
             k--;
         }
     }
     if(left<k)
     {
         quicksort(a, left, k);
     }
     if(j<right)
     {
         quicksort(a, j, right);
     }
 }