Cod sursa(job #626015)
Utilizator | Data | 26 octombrie 2011 08:38:50 | |
---|---|---|---|
Problema | Sortare prin comparare | Scor | 20 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.35 kb |
#include<iostream>
#include<fstream>
using namespace std;
int v[100];
int main(){
int i,j,n,t;
ifstream f("algsort.in");
ofstream g("algsort.out");
f>>n;
for(i=0;i<n;i++)
f>>v[i];
for (i=0;i<n-1;i++)
for(j=i+1;j<n;j++)
if(v[i]>v[j]){
t=v[i];
v[i]=v[j];
v[j]=t;
}
for(i=0;i<n;i++)
g<<v[i]<<" ";
return 0;
}