Cod sursa(job #1344205)
Utilizator | Data | 16 februarie 2015 15:15:41 | |
---|---|---|---|
Problema | Sortare prin comparare | Scor | 20 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.46 kb |
#include <fstream>
using namespace std;
ifstream in("algsort.in");
ofstream out("algsort.out");
int main()
{
int n,i,j,a[100],aux;
in>>n;
for(i=1;i<=n;i++)
{
in>>a[i];
}
for(i=1;i<=n;i++)
for(j=i;j<=n;j++)
if(a[i]>a[j])
{
aux=a[i];
a[i]=a[j];
a[j]=aux;
}
for(i=1;i<=n;i++)
out<<a[i]<<" ";
return 0;
}