Pagini recente » Cod sursa (job #1713816) | Cod sursa (job #1281951) | Cod sursa (job #89876) | Cod sursa (job #357775) | Cod sursa (job #3196529)
#include <fstream>
#include <cstdlib>
using namespace std;
const int N = 5e5;
int v[N];
int partitie(int v[], int st, int dr)
{
/*
int poz_rand = rand() % (dr - st + 1) + st;
swap(v[dr], v[poz_rand]);
*/
int poz_piv = st;
for (int i = st; i < dr; i++)
{
if (v[i] < v[dr])
{
swap(v[i], v[poz_piv++]);
}
}
swap(v[dr], v[poz_piv]);
return poz_piv;
}
void qs(int v[], int st, int dr)
{
if (st >= dr)
{
return;
}
int p = partitie(v, st, dr);
qs(v, st, p - 1);
qs(v, p + 1, dr);
}
int main()
{
ifstream in("algsort.in");
ofstream out("algsort.out");
int n;
in >> n;
for (int i = 0; i < n; i++)
{
in >> v[i];
}
///shuffle
for (int i = n - 1; i > 0; i--)
{
int poz_rand = rand() % (i + 1);
swap(v[i], v[poz_rand]);
}
qs(v, 0, n - 1);
for (int i = 0; i < n; i++)
{
out << v[i] << " ";
}
in.close();
out.close();
return 0;
}