Cod sursa(job #1015114)
| Utilizator | Data | 23 octombrie 2013 21:42:15 | |
|---|---|---|---|
| Problema | Sortare prin comparare | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.56 kb |
#include <fstream.h>
#include <iostream.h>
using namespace std;
void quick(int v[10001],int st,int dr)
{int i=st,j=dr,c,piv=v[(i+j)/2];
while(i<=j)
{
while(v[i]<piv)
i++;
while(v[j]>piv)
j++;
if(i<=j)
{c=v[i];
v[i]=v[j];
v[j]=c;
i++;
j--;}
}
if(st<j)
quick(v,st,j);
if(i<dr)
quick(v,i,dr);}
int main()
{
int n,k,i,v[3000000];
ifstream f("sdo.in");
ofstream g("sdo.out");
f>>n;
for (i=1;i=<n;i++)
f>>v[i];
quick(v,1,n);
for(i=1;i<=n;i++)
g<<v[i]<<" ";
f.close();
g.close();
return 0;
}