Cod sursa(job #1497956)
| Utilizator | Data | 7 octombrie 2015 20:17:10 | |
|---|---|---|---|
| Problema | Sortare prin comparare | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.7 kb |
#include <cstdio>
using namespace std;
int v[500010];
int aux;
void sortare(int st,int dr)
{
int i=st,j=dr,mid=v[(i+j)/2];
do
{
while(v[i]<mid) i++;
while(v[j]>mid) j--;
if(i<=j)
{
aux=v[i];
v[i]=v[j];
v[j]=aux;
i++;
j--;
}
}while(i<=j);
if(st<j) sortare(st,j);
if(dr>i) sortare(i,dr);
}
int main()
{
freopen("algsort.in","r",stdin);
freopen("algsort.out","w",stdout);
int n;
scanf("%d",&n);
for(int i=1;i<=n;i++)
scanf("%d",&v[i]);
sortare(1,n);
for(int i=1;i<=n;i++)
printf("%d ",v[i]);
return 0;
}
