Pagini recente » Cod sursa (job #2121236) | Cod sursa (job #832547) | Clasamentul arhivei de probleme | Cod sursa (job #1903382) | Cod sursa (job #779668)
Cod sursa(job #779668)
#include <time.h>
#include <stdio.h>
#include <stdlib.h>
#include <algorithm>
#define NMax 500010
using namespace std;
const char IN[]="algsort.in",OUT[]="algsort.out";
int N;
int v[NMax];
void sort(int ls,int ld){
if (ls>=ld) return;
int i,j;
swap(v[ls],v[rand()%(ld-ls+1)+ls]);
for (i=ls+1,j=ls;i<=ld;++i)
if (v[i]<=v[ls])
swap(v[i],v[++j]);
swap(v[j],v[ls]);
sort(ls,j-1);
sort(j+1,ld);
}
int main()
{
int i;
freopen(IN,"r",stdin);
scanf("%d",&N);
for (i=1;i<=N;++i) scanf("%d",v+i);
fclose(stdin);
srand(time(NULL));
sort(1,N);
freopen(OUT,"w",stdout);
for (i=1;i<=N;++i) printf("%d ",v[i]); printf("\n");
fclose(stdout);
return 0;
}