Cod sursa(job #1179159)
Utilizator | Data | 28 aprilie 2014 09:01:05 | |
---|---|---|---|
Problema | Sortare prin comparare | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.4 kb |
#include<fstream>
using namespace std ;
ifstream f ("algsort.in") ;
ofstream g ("algsort.out") ;
int v[500005] ;
int main ()
{
int n , i , j ;
f >> n ;
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 )
g << v[i] << " " ;
}