Cod sursa(job #1388676)
| Utilizator | Data | 15 martie 2015 17:20:41 | |
|---|---|---|---|
| Problema | Sortare prin comparare | Scor | 40 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.5 kb |
#include <fstream>
#define NM 500005
using namespace std;
ifstream fin("algsort.in");
ofstream fout("algsort.out");
int n,i,v[NM],j,a;
int main()
{
fin >> n;
for (i=1; i<=n; i++)
{
fin >> v[i];
a=v[i];
j=i-1;
while(j>0 && v[j]>a)
{
v[j+1]=v[j];
j--;
}
v[j+1]=a;
}
for (i=1; i<=n; i++)
fout << v[i] << " ";
fout << '\n';
fin.close();
fout.close();
return 0;
}
