Cod sursa(job #1224158)
| Utilizator | Data | 29 august 2014 23:00:14 | |
|---|---|---|---|
| Problema | Sortare prin comparare | Scor | 60 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.75 kb |
#include<fstream>
#include<cstdlib>
using namespace std;
const int NMAX=500005;
int n,a[NMAX];
inline void Qsort(int st,int dr)
{
if (st<dr)
{
int c,i=st,x,aim=st;
c=(st+dr)>>1;
x=a[c];
swap(a[c],a[dr]);
for (;i<dr;i++)
if (a[i]<=x)
{
swap(a[i],a[aim]);
aim++;
}
swap(a[aim],a[dr]);
Qsort(st,aim-1);
Qsort(aim+1,dr);
}
}
int main()
{
int i;
ifstream fin("algsort.in");
ofstream fout("algsort.out");
fin>>n;
for (i=1;i<=n;i++) fin>>a[i];
Qsort(1,n);
for (i=1;i<=n;i++) fout<<a[i]<<" ";
return 0;
}
