Cod sursa(job #1108236)
Utilizator | Data | 15 februarie 2014 15:10:51 | |
---|---|---|---|
Problema | Sortare prin comparare | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.53 kb |
#include<iostream>
#include<fstream>
using namespace std;
int main()
{
ifstream in("algsort.in");
ofstream out("algsort.out");
int n,i,v[9999999],j,aux;
in>>n;
for(i=1;i<=n;i++)
{
in>>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++)
{
out<<v[i];
}
return 0;
}