Quick_sort
#include <bits/stdc++.h>
using namespace std;
#define read(x) scanf("%d",&x)
const int N = 1e5+10;
int q[N], n;
void quick_sort(int q[], int l, int r)
{
if(l >= r) return;
int x = q[l], i = l - 1, j = r + 1;
while(i < j){
while( q[++i] < x ); while( q[--j] > x );
if(i < j) swap(q[i], q[j]);
}
quick_sort(q, l, j);
quick_sort(q, j+1, r);
}
int main()
{
read(n);
for (int i = 0; i < n ; i ++) read(q[i]);
quick_sort(q, 0, n-1);
for (int i = 0; i < n ; i ++) printf("%d ",q[i]);
return 0;
}
求第K大数 O(n)O(n)O(n) 做法
先随手糊了一个用优先队列的O(nlogn)O(nlogn)O(nlogn)的写法
一直维护一个容量为 kkk 的大根堆,最后输出堆顶就行
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
const int N = 100020;
#define read(x) scanf("%d",&(x))
priority_queue<int> q;
int main()
{
int n, k, t;
read(n); read(k);
for(int i = 1; i <= n ; i++){
read(t);
if(q.size() >= k){
if(q.top() > t) q.pop(),q.push(t);
}else{
q.push(t);
}
}
printf("%d\n",q.top());
}
然后利用快速排序的做法
#include <iostream>
using namespace std;
#define read(x) scanf("%d",&x)
const int N = 1e5+10;
int q[N], n, k;
int quick_sort(int l, int r, int k)
{
if(l == r) return q[l];
int x = q[l], i = l - 1, j = r + 1;
while(i < j){
while(q[ ++ i] < x);
while(q[ -- j] > x);
if(i < j) swap(q[i],q[j]);
}
int sl = j - l + 1;
if(k <= sl) return quick_sort(l, j, k);
quick_sort(j+1, r, k - sl);
}
int main()
{
read(n); read(k);
for (int i = 0; i < n ; i ++) read(q[i]);
cout << quick_sort(0, n-1, k) << endl;
}
准确的时间复杂度是O(2n)O(2n)O(2n)
n+n2+n4+n8⋯n+\frac{n}{2}+\frac{n}{4}+\frac{n}{8} \cdotsn+2n+4n+8n⋯
n⋅∑i=0∞12i=2⋅n n \cdot \sum_{i=0}^{\infty} \frac{1}{2^{i}} = 2 \cdot n n⋅i=0∑∞2i1=2⋅n