Cod sursa(job #772129)
Utilizator | avram andrei marius avram | Data | 28 iulie 2012 13:00:37 |
---|---|---|---|
Problema | Sortare prin comparare | Scor | 40 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include<stdio.h>
int i,j,k,n,s,v[500010],q,max,aux,l;
long long min;
int main()
{
freopen("algsort.in","r",stdin);
freopen("algsort.out","w",stdout);
scanf("%d",&n);
for(i=1;i<=n;i++)
scanf("%d",&v[i]);
for(i=1;i<=n;i++)
{
if(v[i]<v[i-1])
{
j=i;
while(v[j]<v[j-1])
{
aux=v[j-1];
v[j-1]=v[j];
v[j]=aux;
j--;
}
}
}
for(i=1;i<=n;i++)
printf("%d ",v[i]);
return 0;
}