Cod sursa(job #287094)
| Utilizator | Data | 24 martie 2009 15:58:54 | |
|---|---|---|---|
| Problema | Sortare prin comparare | Scor | 20 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.5 kb |
#include <fstream>
using namespace std;
int main()
{
ifstream f("algsort.in");
ofstream f2("algsort.out");
long a[50];
int n;
f>>n;
for(int i=0;i<n;i++) f>>a[i];
for(int i=0;i<n-1;i++)
for(int j=i+1;j<n;j++)
if(a[i]>a[j])
{
long aux = a[i];
a[i] = a[j];
a[j] = aux;
}
for(int i=0;i<n;i++) f2<<a[i]<<" ";
f.close();
f2.close();
return 0;
}
