Cod sursa(job #1020669)
| Utilizator | Data | 2 noiembrie 2013 14:27:18 | |
|---|---|---|---|
| Problema | Sortare prin comparare | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.58 kb |
# include <fstream>
# define N 500000
using namespace std;
ifstream fin("algsort.in");
ofstream fout("algsort.out");
int v[N];
void algsort()
{
int i,sp,val;
for( i = 1 ; i < N ; ++i )
{
val = v[i];
for( sp = i ; sp > 0 && val < v[sp-1] ; --sp )
v[sp] = v[sp-1];
v[sp] = val;
}
}
int main(){
int N,i;
fin >> N;
for( i = 0 ; i < N ; ++i )
fin >> v[i];
algsort();
for( i = 0 ; i < N ; ++i )
fout << v[i] << ' ';
fin.close();
fout.close();
return 0;
}
