Pagini recente » Cod sursa (job #712203) | Cod sursa (job #2908731) | Cod sursa (job #917396) | Cod sursa (job #1326450) | Cod sursa (job #1140585)
#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;
}