Cod sursa(job #1108287)
Utilizator | Data | 15 februarie 2014 15:45:17 | |
---|---|---|---|
Problema | Sortare prin comparare | Scor | 40 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.5 kb |
#include <iostream>
#include <fstream>
using namespace std;
int main()
{
long x,n,p,i,m,j;
ifstream f("algsort.in");
ofstream g("algsort.out");
f>>n;
long v[n+1];
for(i=1;i<=n;i++){
f>>v[i];
}
for(i=1;i<=n-1;i++){
for(j=i+1;j<=n;j++){
if(v[i]>v[j]){
x=v[i];
v[i]=v[j];
v[j]=x;
}
}
}
for(i=1;i<=n;i++){
g<<v[i]<<" ";
}
return 0;
}