quick.c

来源:互联网 发布:偏偏喜欢你续写淘宝 编辑:程序博客网 时间:2024/04/29 19:06

 <iframe name="google_ads_frame" marginwidth="0" marginheight="0" src="http://pagead2.googlesyndication.com/pagead/ads?client=ca-pub-5572165936844014&amp;dt=1194442938015&amp;lmt=1194190197&amp;format=336x280_as&amp;output=html&amp;correlator=1194442937843&amp;url=file%3A%2F%2F%2FC%3A%2FDocuments%2520and%2520Settings%2Flhh1%2F%E6%A1%8C%E9%9D%A2%2FCLanguage.htm&amp;color_bg=FFFFFF&amp;color_text=000000&amp;color_link=000000&amp;color_url=FFFFFF&amp;color_border=FFFFFF&amp;ad_type=text&amp;ga_vid=583001034.1194442938&amp;ga_sid=1194442938&amp;ga_hid=1942779085&amp;flash=9&amp;u_h=768&amp;u_w=1024&amp;u_ah=740&amp;u_aw=1024&amp;u_cd=32&amp;u_tz=480&amp;u_java=true" frameborder="0" width="336" scrolling="no" height="280" allowtransparency="allowtransparency"></iframe> #include <stdio.h>
#include <stdlib.h>

void quick_sort(int array[], int first, int last)
 {
   int temp, low, high, list_separator;   
  
   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)
    quick_sort(array, first, high);
  if (low < last)
    quick_sort(array, low, last);
 }

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

   for (i = 0; i < 100; i++)
     values[i] = rand() % 100;

   quick_sort(values, 0, 99);

   for (i = 0; i < 100; i++)
     printf("%d ", values[i]);
 }