quick.c

最新推荐文章于 2025-11-25 12:12:47 发布

原创最新推荐文章于 2025-11-25 12:12:47 发布 · 582 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#list #include

Q 专栏收录该内容

4 篇文章

订阅专栏

本文介绍了一个使用C语言实现的快速排序算法。通过递归方式，该算法能够有效地对整数数组进行排序。文章中详细展示了如何选取基准元素，并通过交换元素的方式完成分区操作。

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