qsort.c
#include<stdio.h>
#include<stdlib.h>
#include<assert.h>
#include<time.h>
#define N 1000
//快排升序
void Swap(int* a, int* b)
{
int mid = *a;
*a = *b;
*b = mid;
}
#if 0
void _QSort(int* array, int left, int right)
{
int begin = left;
int end = right;
if (begin >= right)
return;
//开始快排
int keyi = left;
while (left < right)
{
while (right>left&&array[right] >=array[keyi])//右找小
right--;
while (left < right && array[left] <=array[keyi])//查找时必须跳过等于的情况,left,right都等于keyi对应的值,交换后不变,死循环
left++;
Swap(array + left, array + right);
}
Swap(array + keyi, array + left);
keyi = left;
//递归
_QSort(array,begin, keyi - 1);
_QSort(array, keyi + 1, end);
}
#endif
#if 1//三数找中间的方法,让keyi不取端点值->让keyi每次都能到接近中间位置,递归层数相当于二分,logn
int MidNum(int*array, int a, int b)//找头尾和中间对应值的中间值
{
int c = (a + b) / 2;//中间下标
int loc[3] = { a,b,c };
//数少插排
for (int i = 0; i < 2; i++)
{
int end = i;
int tmp=loc[end + 1] ;
while (end >= 0&& array[tmp] < array[loc[end]])
{
loc[end + 1] = loc[end];
end -= 1;
}
loc[end + 1] = tmp;
}
return loc[1];
}
void _QSort(int* array, int left, int right)
{
int begin = left;//left,right相当于定位器,会动,新置变量记录头尾位置
int end = right;
if (begin >= end)//递归结束条件
return;
int keyi = MidNum(array, begin, end);//找keyi
Swap(array + keyi, array + begin);//要让keyi在最前面,因为最后left,right相遇找到的值一定比keyi小,如果keyi在中最后,可能把小的换最后了,就不符合小的在左边,大在右,keyi在正确位置了
keyi = begin;
//开始找keyi对应值所在位置
while (left < right)//等于就跳出
{
while (right > left && array[right] >= array[keyi])//right找比keyi对应值小的,等于跳过
right--;
while (left < right && array[left] <= array[keyi])
left++;
Swap(array + left, array + right);//交换找到的值
}
Swap(array + keyi, array + left);
keyi = left;
_QSort(array, begin, keyi - 1);
_QSort(array, keyi+1, end);
}
#endif
#if 0//找随机法,随机找区间数做keyi并换至最前
void _QSort(int* array, int left, int right)
{
int begin = left;
int end = right;
if (begin >= end)
return;
int keyi = rand() % (right - left + 1)+begin;//注意begin是区间开头
Swap(array + keyi, array+begin);
keyi = begin;
while (left < right)
{
while (left < right && array[right] >= array[keyi])
right--;
while (right > left && array[left] <= array[keyi])
left++;
Swap(array + left, array + right);
}
Swap(array + keyi, array + left);
keyi = left;
_QSort(array, begin, keyi - 1);
_QSort(array, keyi + 1, end);
}
#endif
int main()
{
srand((unsigned int)time(0));
int* array = (int*)malloc(sizeof(int) * N);
assert(array);
for (int i = 0; i < N; i++)
array[i] = rand() % 1000 + 1;
_QSort(array, 0, N - 1);
for (int i = 0; i < N; i++)
printf("%d ", array[i]);
return 0;
}