Cod sursa(job #241489)
| Utilizator | Data | 10 ianuarie 2009 11:08:03 | |
|---|---|---|---|
| Problema | Sortare prin comparare | Scor | 40 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.45 kb |
#include<fstream>
#include<algorithm>
using namespace std;
int a[500009];
void selectsort(int n){
int i, j;
for(i=0;i<n;i++){
for(j=i+1;j<n;j++)
if(a[i]>a[j])
swap(a[i],a[j]);
}
}
int main(){
ifstream f("algsort.in");
ofstream g("algsort.out");
int n,i;
f>>n;
for(i=0;i<n;i++)
f>>a[i];
f.close();
selectsort(n);
for(i=0;i<n;i++)
g<<a[i]<<' ';
g<<'\n';
g.close();
return 0;
}
