Cod sursa(job #721855)
Utilizator | Data | 24 martie 2012 12:15:09 | |
---|---|---|---|
Problema | Sortare prin comparare | Scor | 20 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.34 kb |
#include<fstream>
using namespace std;
ifstream f("algsort.in");
ofstream g("algsort.out");
int n , a[100] , i , j,b;
int main()
{
f>>n;
for(i=1;i<=n;i++)
f>>a[i];
for(i=1;i<n;i++)
for(j=i+1;j<=n;j++)
if(a[i]>a[j]){
b=a[i];
a[i]=a[j];
a[j]=b;
}
for(i=1;i<=n;i++)
g<<a[i]<<" ";
return 0;
}