Cod sursa(job #1448680)
Utilizator | Data | 7 iunie 2015 19:23:49 | |
---|---|---|---|
Problema | Sortare prin comparare | Scor | 40 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.55 kb |
#include <fstream>
#define NMAX 500010
using namespace std;
ifstream in("algsort.in");
ofstream out("algsort.out");
int i,j,n,aux,aux2;
int v[NMAX];
int main()
{
in>>n;
for(i=1;i<=n;i++)
{
in>>v[i];
}
for(i=2;i<=n;i++)
{
j=i-1;
aux=v[i];
while(v[j]>aux && j>=1)
{
aux2=v[j+1];
v[j+1]=v[j];
v[j]=aux2;
j--;
}
}
for(i=1;i<=n;i++) out<<v[i]<<" ";
in.close();
out.close();
return 0;
}