Pagini recente » Istoria paginii utilizator/alex_aelenei | Cod sursa (job #1690754) | Cod sursa (job #2742484) | Cod sursa (job #2550044) | Cod sursa (job #2941792)
#include <iostream>
#include <fstream>
#include <cmath>
#include <algorithm>
using namespace std;
ifstream fin("algsort.in");
ofstream fout("algsort.out");
int v[100001];
void part3(int v[], int st, int dr, int& p1, int& p2) {
p1 = st;
p2 = dr - 1;
int i = st;
while (i <= p2) {
if (v[i] < v[dr]) {
swap(v[i++], v[p1++]);
}
else if (v[i] > v[dr]) {
swap(v[i], v[p2--]);
}
else {
i++;
}
}
swap(v[++p2], v[dr]);
}
void qs(int v[], int st, int dr) {
if (st >= dr) {
return;
}
int p1, p2;
part3(v, st, dr, p1, p2);
qs(v, st, p1 - 1);
qs(v, p2 + 1, dr);
}
int main()
{
int n;
fin >> n;
for (int i = 1; i <= n; i++) {
fin >> v[i];
}
qs(v, 1, n);
for (int i = 1; i <= n; i++) {
fout << v[i] << " ";
}
return 0;
}