mooc课程精选,成品人片观看入口众乐乐,久久久久人妻一区精品性色av,苍兰诀大结局是什么,白丝美女被狂躁免费视频网站

快速排序實質上是對“冒泡排序”的一種改進，整個排序過程可概括為：通過N趟的排序將原本的排序數據分為若干塊進行分塊排序，而在每趟排序過程中，以指定的關鍵字將待排數據分別分為比關鍵字大的部分和比關鍵字小的部分，反復上述過程，將整個待排數列分散為若干個小數列而分別進行排序操作。假設我們現對一列數進行快速排序，其C語言代碼實現如下：

#include <stdio.h>
        int partition(int *data,int low,int high)
        {       int t = 0;
                t = data[low];
                while(low < high)
                {       while(low < high && data[high] >= t)
                                high--;
                        data[low] = data[high];
                        while(low < high && data[low] <= t)
                                low++;
                        data[high] = data[low];
                }
                data[low] = t;
                return low;
        }

void sort(int *data,int low,int high)        //快排每趟進行時的樞軸要重新確定，由此進 //一步確定每個待排小記錄的low及high的值
        {       if(low >= high)
                        return ;
                int pivotloc = 0;
                pivotloc = partition(data,low,high);
                sort(data,low,pivotloc-1);
                sort(data,pivotloc+1,high);
        }
        void quick_sort(int *data,int n)         //該函數進行sort過程的調用
        {         sort(data,0,n-1); }

int main()
        {       int i;
                int data[]={49,38,32,98,65,74,12,8};
                quick_sort(data,sizeof(data)/sizeof(int));
                for( i = 0 ; i < sizeof(data)/sizeof(int); i++)
                printf("%d ",data[i]);
                printf("\n");
                return 0;
        }