Cod sursa(job #961770)
Utilizator | Data | 12 iunie 2013 20:32:58 | |
---|---|---|---|
Problema | Sortare prin comparare | Scor | 40 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include<fstream>
using namespace std;
ifstream f("algsort.in");
ofstream g("algsort.out");
int main()
{ int n,v[500001],i,j,aux;
f>>n;
for(i=1;i<=n;i++) f>>v[i];
for(i=1;i<=n;i++)
for(j=1;j<n;j++)
if(v[j]>v[j+1])
{
aux=v[j];
v[j]=v[j+1];
v[j+1]=aux;
}
for(i=1;i<=n;i++) g<<v[i]<<" ";
g.close (); return 0;
}