Cod sursa(job #1140585)
| Utilizator | Data | 12 martie 2014 09:07:09 | |
|---|---|---|---|
| Problema | Sortare prin comparare | Scor | 40 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.48 kb |
#include <cstdio>
#include <iostream>v
using namespace std;
int n,a[500000],x,j;
int main()
{
freopen ("algsort.in","r",stdin);
freopen ("algsort.out","w",stdout);
scanf("%d",&n);
for(int i=0;i<n;i++)
scanf("%d",&a[i]);
for (int i=0;i<n;i++)
{
x=a[i];
j=i;
while (j > 0 and a[j-1] > x)
{a[j]=a[j-1];
j--;}
a[j]=x;
}
for(int i=0;i<n;i++)
printf("%d ",a[i]);
return 0;
}
