Cod sursa(job #1344177)
Utilizator | Data | 16 februarie 2015 15:03:09 | |
---|---|---|---|
Problema | Sortare prin comparare | Scor | 20 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include <fstream>
using namespace std;
ifstream in("algsort.in");
ofstream out("algsort.out");
int main()
{
int n,i,v[100],j,aux;
in>>n;
for(i=1;i<=n;i++)
in>>v[i];
for(i=1;i<n;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;
}