Cod sursa(job #1047591)
Utilizator | Data | 4 decembrie 2013 18:49:35 | |
---|---|---|---|
Problema | Sortare prin comparare | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.65 kb |
#include<fstream>
# include <algorithm>
using namespace std;
ifstream f("algsort.in");
ofstream g("algsort.out");
int i,n,a[500001],j;
void qsort(int st, int dr)
{
int i,j,pivot,aux;
i=st; j=dr; pivot=a[(i+j)/2];
while(i<=j)
{
while(a[i]<pivot) i++;
while(a[j]>pivot) j--;
if (i<j)
{
aux=a[i];a[i]=a[j];
a[j]=aux;
i++; j--;
}
}
if (i<dr) qsort(i,dr);
if (j>st) qsort(st,j);
}
int main()
{
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;
}