Pagini recente » Cod sursa (job #1553702) | Cod sursa (job #2113525) | Cod sursa (job #1801646) | Cod sursa (job #1846014) | Cod sursa (job #2173980)
#include <bits/stdc++.h>
using namespace std;
#if 1
#define pv(x) cout<<#x<<" = "<<x<<"; ";cout.flush()
#define pn cout<<endl
#else
#define pv(x)
#define pn
#endif
#ifdef ONLINE_JUDGE
#define in cin
#define out cout
#else
ifstream in("algsort.in");
ofstream out("algsort.out");
#endif
using ll = long long;
using ull = unsigned long long;
using ui = unsigned int;
#define pb push_back
#define mp make_pair
const int NMax = 5e5 + 5;
const ll inf_ll = 1e18 + 5;
const int inf_int = 1e9 + 5;
const int mod = 100003;
using zint = int;
int N;
int v[NMax];
int part(int,int);
void solve(int st,int dr) {
if (st >= dr) {
return;
}
int idx = part(st,dr);
solve(st,idx-1);
solve(idx+1,dr);
}
int part(int st,int dr) {
swap(v[ rand() % (dr - st + 1) + st ], v[dr]);
int pivot = v[dr];
int i = st-1;
for (int j = st;j <= dr;++j) {
if (v[j] <= pivot) {
++i;
swap(v[i],v[j]);
}
}
return i;
}
int main() {
in.sync_with_stdio(false);
in.tie(0);
out.tie(0);
out.sync_with_stdio(false);
in >> N;
for (int i = 1;i <= N;++i) {
in >> v[i];
}
srand(time(NULL));
solve(1,N);
for (int i = 1;i <= N;++i) {
out << v[i] << ' ';
}
return 0;
}