Pagini recente » Cod sursa (job #1043773) | Cod sursa (job #2626690) | Cod sursa (job #1095504) | Borderou de evaluare (job #2772046) | Cod sursa (job #2760160)
#include <fstream>
#include <ctime>
#include <cstdlib>
using namespace std;
ifstream cin("algsort.in");
ofstream cout("algsort.out");
int sir[500005], N;
void Random_Pivot(int L, int R)
{
int P = L + rand() % (R - L);
swap(sir[L], sir[P]);
}
int Divide(int L, int R)
{
Random_Pivot(L, R);
int st = L, dr = R, x = sir[L];
while(st < dr)
{
while(st < dr && sir[dr] >= x) dr--;
sir[st] = sir[dr];
while(st < dr && sir[st] <= x) st++;
sir[dr] = sir[st];
}
sir[st] = x;
return st;
}
void QuickSort(int L, int R)
{
int M = Divide(L, R);
if(M - L > 1) QuickSort(L, M - 1);
if(R - M > 1) QuickSort(M + 1, R);
}
int main()
{
srand(time(NULL));
cin >> N;
for(int i = 1; i <= N; i++)
cin >> sir[i];
QuickSort(1, N);
for(int i = 1; i <= N; i++)
cout << sir[i] << " ";
return 0;
}