Pagini recente » Cod sursa (job #646617) | Cod sursa (job #666062) | Cod sursa (job #2440493) | Borderou de evaluare (job #2012148) | Cod sursa (job #3254134)
#include <fstream>
#include <ctime>
#include <cstdlib>
#include <algorithm>
using namespace std;
ifstream cin("algsort.in");
ofstream cout("algsort.out");
int n,v[500005];
void sorteaza(int st,int dr)
{
if(st<dr)
{
int p=rand()%(dr-st+1)+st;
swap(v[p],v[st]);
int i=st;
int j=dr;
int mod=0;
while(i<j)
{
if(v[i]>v[j])
{
swap(v[i],v[j]);
mod=1-mod;
}
i=i+mod;
j=j-(1-mod);
}
sorteaza(st,i-1);
sorteaza(i+1,dr);
}
}
int main()
{
srand(time(NULL));
cin>>n;
for(int i=1;i<=n;i++)
cin>>v[i];
sorteaza(1,n);
for(int i=1;i<=n;i++)
cout<<v[i]<<" ";
return 0;
}