Cod sursa(job #1367966)
Utilizator | Alex Bercea Alex1199 | Data | 2 martie 2015 12:13:52 |
---|---|---|---|
Problema | Sortare prin comparare | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.48 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, x=a[(l+r)/2];
while (i<=j)
{
while(a[i]<x) i++;
while(a[j]>x) j--;
if(i<=j)
{swap(a[i],a[j]); i++; j--;}
}
if(i>l) qsort(l,j);
if(j<r) qsort(i,r);
}
int main()
{
f>>n;
for(int i=1;i<=n;i++)
f>>a[i];
qsort(1,n);
for(int i=1;i<=n;i++)
g<<a[i]<<' ';
return 0;
}