Cod sursa(job #2262500)
| Utilizator | Data | 17 octombrie 2018 15:16:09 | |
|---|---|---|---|
| Problema | Sortare prin comparare | Scor | 40 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.61 kb |
#include <fstream>
#include <climits>
using namespace std;
ifstream fin("algsort.in");
ofstream fout("algsort.out");
#define NMAX 500001
int n,v[NMAX];
void citire()
{ fin>>n;
int i;
for(i = 1; i <= n; i++)
fin>>v[i];
}
void rezolvare()
{citire();
int i,j,maximao,p,aux;
for(i = 1; i <= n; i++)
{aux = v[i];
j = i - 1;
while(j >= 0 && v[j] > aux)
{v[j+1] = v[j];
j = j-1;
}
v[j+1] = aux;
}
for(i = 1; i <= n; i++)
fout<<v[i]<<' ';
}
int main()
{
rezolvare();
fin.close();
fout.close();
return 0;
}
