0x01_快速排序
时间复杂度:
平均O(n*log2n) 最坏的情况O(n^2)
模板 Quicksort():
void Quicksort(int array[], int l, int r)
{
if(l>=r) return ;
int left = l, right = r;
int pivot = array[left];
while (left < right)
{
while (left < right && array[right] >= pivot) right--;
if(left<right){
array[left] = array[right];
left++;
}
while (left < right && array[left] <= pivot) left++;
if(left<right){
array[right] = array[left];
right--;
}
}
array[left]=pivot;
Quicksort(array, l, right-1);
Quicksort(array, left+1, r);
}
来看一道水题实践一下吧:
表面上是一道简单的快排的运用,实际上数据刚好卡在最坏的情况,超时TLE
所以传统的快排是无法AC的
错误代码
#include <bits/stdc++.h>
using namespace std;
int n, a[100005];
void Quicksort(int array[], int l, int r)
{
if(l>=r) return ;
int left = l, right = r;
int pivot = array[left];
while (left < right)
{
while (left < right && array[right] >= pivot)
right--;
if(left<right){
array[left] = array[right];
left++;
}
while (left < right && array[left] <= pivot)
left++;
if(left<right){
array[right] = array[left];
right--;
}
}
array[left]=pivot;
Quicksort(array, l, right-1);
Quicksort(array, left+1, r);
}
int main()
{
cin >> n;
for (int i = 1; i <= n; i++)
{
cin >> a[i];
}
Quicksort(a, 1, n);
for (int i = 1; i < n ; i++)
{
cout << a[i] <<" ";
}
cout<<a[n]<<endl;
}
看了题解,运用二分思想,复杂度就降到O(log2n)了
#include <bits/stdc++.h>
using namespace std;
int n, a[100005];
void Quicksort(int array[], int l, int r)
{
int left = l, right = r;
int mid = array[(left+right)/2]; //二分思想,每次取中间数
do{
while(array[left]<mid) left++;
while(array[right]>mid) right--;
if(left<=right){
swap(array[left],array[right]);
left++;
right--;
}
}while(left<=right);
if(l<right) Quicksort(array, l, right);
if(left<r) Quicksort(array, left, r);
}
int main()
{
cin >> n;
for (int i = 1; i <= n; i++)
{
cin >> a[i];
}
Quicksort(a, 1, n);
for (int i = 1; i < n ; i++)
{
cout << a[i] <<" ";
}
cout<<a[n]<<endl;
}