目录
一 .快速排序(递归)
思想:任取待排序元素序列中的某元素作为基准值,按照该排序码将待排序集合分割成两子序列,左子序列中所有元素均小于基准值,右子序列中所有元素均大于基准值,然后最左右子序列重复该过程,直到所有元素都排列在相应位置上为止
代码:
#include<stdio.h>
#include<stdlib.h>
#include<string.h>
#include<errno.h>
void Swap(int* p1, int* p2)
{
int tmp = *p1;
*p1 = *p2;
*p2 = tmp;
}
int PartSort1(int* a, int left, int right)// hoare
{
int keyi = left;
while (left < right)
{
while (left < right && a[right] >= a[keyi])
{
right--;
}
while (left < right && a[left] <= a[keyi])
{
left++;
}
Swap(&a[left], &a[right]);
}
Swap(&a[left], &a[keyi]);
return left;
}
int PartSort2(int* a, int left, int right)// 挖坑
{
int key = a[left];
int hole = left;
while (left < right)
{
while (left < right && a[right] >= key)
{
right--;
}
a[hole] = a[right];
hole = right;
while (left < right && a[left] <= key)
{
left++;
}
a[hole] = a[left];
hole = left;
}
a[hole] = key;
return hole;
}
int PartSort3(int* a, int left, int right)// 前后指针
{
int keyi = left;
int cur = left + 1;
int prev = left;
while (cur <= right)
{
if (a[cur] < a[keyi] && ++prev != cur)
{
Swap(&a[prev], &a[cur]);
}
cur++;
}
Swap(&a[prev], &a[keyi]);
return prev;
}
void QuickSort(int* a, int left, int right)
{
if (left >= right)
{
return;
}
int keyi = PartSort1(a, left, right);
//左:[left, keyi-1] keyi [keyi+1, right]:右
QuickSort(a, left, keyi - 1);
QuickSort(a, keyi + 1, right);
}
二 .非递归
用栈 或 队列 实现(类似于 前序遍历)
void QuickSort(int* a, int n)
{
ST s;
STPush(&s, n-1);
STPush(&s, 0);
while (!STEmpty(&s))
{
int left = STTop(&s);
STPop(&s);
int right = STTop(&s);
STPop(&s);
int keyi = PartSort(a, left, right);
if (keyi + 1 < right)
{
STPush(&s, right);
STPush(&s, keyi + 1);
}
if (left < keyi - 1)
{
STPush(&s, keyi - 1);
STPush(&s, left);
}
}
STDestroy(&s);
}
三 .优化
时间复杂度:O ( N * logN) (N是数组大小)
空间复杂度:O (logN)
不稳定
快速排序对于有些序列效率差(常数列,有序序列)
代码如下:
//三数取中
int GetMidIndex(int* a, int left, int right)
{
int mid = (left + right) / 2;
if (a[left] < a[mid])
{
if (a[mid] < a[right])
{
return mid;
}
else if (a[left] < a[right])
{
return right;
}
else
{
return left;
}
}
else
{
if (a[mid] > a[right])
{
return mid;
}
else if (a[left] > a[right])
{
return right;
}
else
{
return left;
}
}
}
int PartSort1(int* a, int left, int right)// hoare
{
int midi = GetMidIndex(a, left, right);//三数取中
Swap(&a[left], &a[midi]);
int keyi = left;
while (left < right)
{
while (left < right && a[right] >= a[keyi])
{
right--;
}
while (left < right && a[left] <= a[keyi])
{
left++;
}
Swap(&a[left], &a[right]);
}
Swap(&a[left], &a[keyi]);
return left;
}
void QuickSort2(int* a, int left, int right)
{
srand((unsigned int)time(NULL));
if (left >= right)
{
return;
}
int begin = left;
int end = right;
int cur = left + 1;
//随机数法
int midi = left + (rand() % (right - left));
Swap(&a[left], &a[midi]);
int key = a[left];
while (cur < right)
{
if (a[cur] < key)
{
Swap(&a[left], &a[cur]);
left++;
cur++;
}
else if (a[cur] > key)
{
Swap(&a[right], &a[cur]);
right--;
}
else
{
cur++;
}
}
//[begin, left-1] left……right [right+1, end]
QuickSort2(a, begin, left - 1);
QuickSort2(a, right + 1, end);
}
不同的排序有不同的用法,快速排序并不是万能的,就比如不稳定,有些题目解决不了
力扣(快速排序解决不了)