一、
函数:void Quick_Sort(int *nums,int low,int high,int Bool)
参数解释
nums:数组指针
[low, high]:需排序的数组范围
Bool:等于1表示从小到大排序,不等于1从大到小排序
说明
将low1与high1看作指针
扫描数组中low到high范围
通过“双指针”比较交换使得low1左边的值始终小于(大于等于)flag,使得high1右边的值始终大于等于(小于)flag
最后low1=high1时的位置左边的值小于flag,右边的值大于等于flag,而flag正好位于此处
#include <stdio.h>
#include <time.h>
void Quick_Sort(int *nums,int low,int high,int Bool){//需排序的片段首位序号
if(high>low){
int low1=low,high1=high,flag=nums[low],temp;
while(high1>low1){
while(high1>low1 && (nums[high1]>=flag==Bool)) high1--;
nums[low1]=nums[high1];
while(high1>low1 && (nums[low1]<flag==Bool)) low1++;
nums[high1]=nums[low1];
}
nums[low1]=flag;
Quick_Sort(nums,low,low1-1,Bool);
Quick_Sort(nums,low1+1,high,Bool);
}
}
int main(int argc, char **argv) {
printf("Hello, World!\n");
int s[5];
s[0]=2;
s[1]=5;
s[2]=1;
s[3]=4;
s[4]=3;
int i=0;
while(i<5)printf("%d ",s[i++]);
printf("\n---------\n");
Quick_Sort(s,0,4,1);
int j=0;
while(j<5)printf("%d ",s[j++]);
return 0;
}