Cod sursa(job #846531)
Utilizator | Dinu Radu RaduGabriel2012 | Data | 2 ianuarie 2013 13:11:40 |
---|---|---|---|
Problema | Sortare prin comparare | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.52 kb |
#include<fstream>
using namespace std;
ifstream f("algsort.in");
ofstream g("algsort.out");
int a[500001],n;
void qsort(int l,int r)
{
int i=l,j=r,p=a[(l+r)/2];
while(i<j)
{
while(a[i]<p)i++;
while(a[j]>p)j--;
if(i<=j)
{
swap(a[i],a[j]);
i++;
j--;
}
}
if(j>l) qsort(l,j);
if(i<r) qsort(i,r);
}
int main()
{int i;
f>>n;
for(i=1;i<=n;i++) f>>a[i];
qsort(1,n);
for(i=1;i<=n;i++) g<<a[i]<<" ";
return 0;
}