Cod sursa(job #1469760)
Utilizator | Data | 9 august 2015 14:58:52 | |
---|---|---|---|
Problema | Sortare prin comparare | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include <fstream>
using namespace std;
ifstream fin("algsort.in");
ofstream fout("algsort.out");
int main()
{
int n,v[500000],i,j,aux;
fin>>n;
for(i=1;i<=n;i++)
fin>>v[i];
for(i=1;i<n-1;i++)
for(j=i+1;j<n;j++)
if(v[i]>v[j])
{
aux=v[i];
v[i]=v[j];
v[j]=aux;
}
for(i=1;i<=n;i++)
fout<<v[i]<<" ";
return 0;
}