Cod sursa(job #1336858)
Utilizator | Data | 8 februarie 2015 13:00:58 | |
---|---|---|---|
Problema | Sortare prin comparare | Scor | 20 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.46 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("algsort.in");
ofstream g("algsort.out");
int main()
{
int v[100],N,i,j,aux;
f>>N;
for(i=1;i<=N;i++)
f>>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++)
g<<v[i]<<" ";
return 0;
}