Pagini recente » Cod sursa (job #3234678) | Cod sursa (job #3215581) | Cod sursa (job #3236651) | Cod sursa (job #2288506) | Cod sursa (job #3263860)
#include <fstream>
#include <cstdlib>
using namespace std;
const int N = 5e5;
int v[N];
int part2(int v[], int st, int dr)
{
//int poz_p = rand() % (dr - st + 1) + st;
//swap(v[poz_p], v[dr]);
int p = st;
for (int i = st; i < dr; i++)
{
if (v[i] <= v[dr])
{
swap(v[p++], v[i]);
}
}
swap(v[p], v[dr]);
return p;
}
void qs(int v[], int st, int dr)
{
if (st >= dr)
{
return;
}
int p = part2(v, st, dr);
qs(v, st, p - 1);
qs(v, p + 1, dr);
}
void shuffle(int v[], int n)
{
for (int i = n - 1; i >= 1; i--)
{
///pe fiecare pozitie i aducem un element aleator intre 0 si i
int poz_rand = rand() % (i + 1);
swap(v[poz_rand], v[i]);
}
}
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(v, n);
qs(v, 0, n - 1);
for (int i = 0; i < n; i++)
{
out << v[i] << " ";
}
in.close();
out.close();
return 0;
}