Cod sursa(job #632174)
| Utilizator | Data | 10 noiembrie 2011 14:48:51 | |
|---|---|---|---|
| Problema | Sortare prin comparare | Scor | 40 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.4 kb |
#include<stdio.h>
using namespace std;
long n,A[10000];
int main()
{
freopen("algsort.in","r",stdin);
freopen("algsort.out","w",stdout);
int n,i,j,key;
scanf("%d",&n);
for(i=1;i<=n;i++)
scanf("%d",&A[i]);
for(j=2;j<=n;j++)
{
key=A[j];
i=j-1;
while(A[i]>key&&i>0)
{
A[i+1]=A[i];
i--;
}
A[i+1]=key;
}
for(i=1;i<=n;i++)
printf("%d ",A[i]);
return 0;
}