Cod sursa(job #1651135)
Utilizator | Data | 12 martie 2016 12:52:25 | |
---|---|---|---|
Problema | Sortare prin comparare | Scor | 40 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.47 kb |
#include <fstream>
using namespace std;
ifstream in ("algsort.in");
ofstream out ("algsort.out");
int main()
{
int n, v[500000], i, j, x;
in>>n;
for (i=1; i<=n; i++) in>>v[i];
for(i=2; i<=n; i++)
{
x = v[i];
j = i-1;
while( j >= 1 && v[j] > x )
{
v[j+1] = v[j];
j--;
}
v[j+1] = x;
}
for(i=1; i<=n; i++)
out<<v[i]<<" ";
return 0;
}