Pagini recente » Cod sursa (job #527528) | Cod sursa (job #1360641) | Cod sursa (job #1445238) | Cod sursa (job #955312) | Cod sursa (job #1577787)
#include<fstream>
#include<time.h>
#include <stdlib.h>
using namespace std;
fstream f("algsort.in",ios::in);
fstream g("algsort.out",ios::out);
int a[500003],n,k;
void quick(int li,int ls)
{
int pivot,i=li,j=ls;
pivot=a[i+rand()%(j-i+1)];
while (i <= j)
{
while (a[i] < pivot && i < ls) i++;
while (a[j] > pivot && j > li) j--;
if (i <= j)
{
swap(a[i], a[j]);
i++;
j--;
}
}
if (j > li) quick(li, j);
if (i < ls) quick(i, ls);
}
int main()
{
int i;
f>>n;
for(i=1; i<=n; i++) f>>a[i];
srand(time(0));
quick(1,n);
for(i=1; i<=n; i++)g<<a[i]<<" ";
g.close();
f.close();
return 0;
}