t2.c

来自「自己做的常用库和实现的数据结构。public domain.」· C语言 代码 · 共 54 行

#include <stdio.h>
#include <stdlib.h>
#include <time.h>

void quick_sort(int array[], int first, int last)
 {
   int temp, low, high, list_separator;    
loop:
   
   low = first;
   high = last;
   list_separator = array[(first + last) / 2];

   do {
     while (array[low] < list_separator)
       low++;

     while (array[high] > list_separator)
       high--;
   
     if (low <= high)
      {  
        temp = array[low];
        array[low++] = array[high];
        array[high--] = temp;
      }
   } while (low <= high);

  if (first < high) {
   last = high;
   	goto loop;
  }
  if (low < last) {
	  first = low;
   	goto loop;
  }
 }

void main(void)
 {
   int values[100], i; 

   srand(time(NULL));
   for (i = 0; i < 100; i++)
     printf("%d ", values[i]=rand()%100);

   quick_sort(values, 0, 99);

   puts("\n\nafter quick sort:");
   for (i = 0; i < 100; i++)
     printf("%d ", values[i]);
 }