Cod sursa(job #1625412)
Utilizator | Data | 2 martie 2016 18:45:50 | |
---|---|---|---|
Problema | Sortare prin comparare | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.46 kb |
#include<iostream>
#include<fstream>
#include<math.h>
using namespace std;
int main()
{
long long n,i,j;
long a[500000],key;
ifstream f("algsort.in");
ofstream g("algsort.out");
f>>n;
for(j=2;j<=n;j++)
{
key=a[j];
i=j-1;
while(i>0&&a[i]>key)
{
a[i+1]=a[i];
a[i]=key;
i--;
}
}
for(i=1;i<=n;i++)
g<<a[i]<<" ";
return 0;
}