Cod sursa(job #495447)
| Utilizator | Data | 25 octombrie 2010 12:28:06 | |
|---|---|---|---|
| Problema | Sortare prin comparare | Scor | 20 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.42 kb |
#include <fstream>
using namespace std;
ifstream fin("algsort.in");
ofstream fout("algsort.out");
int main()
{
int a[100], n;
fin >> n;
for ( int i = 0; i < n; i++ )
fin >> a[i];
for ( int i = 0; i < n-1; i++ )
for ( int j = i+1; j < n; j++ )
if ( a[i] > a[j] )
{
a[i] += a[j];
a[j] = a[i] - a[j];
a[i] -= a[j];
}
for ( int i = 0; i < n; i++ )
fout << a[i] << ' ';
return 0;
}
