Cod sursa(job #1679646)
Utilizator | Data | 8 aprilie 2016 09:42:59 | |
---|---|---|---|
Problema | Sortare prin comparare | Scor | 40 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.37 kb |
#include <fstream>
using namespace std;
ifstream fin("algsort.in");
ofstream fout("algsort.out");
int a[500001],i,j,n;
int main()
{
fin>>n;
for(i=1;i<=n;++i)
fin>>a[i];
for(i=1;i<=n-1;++i)
for(j=i+1;j<=n;++j)
if(a[i]>a[j]){a[0]=a[i];a[i]=a[j];a[j]=a[0];}
for(i=1;i<=n;i++)
fout<<a[i]<<' ';
return 0;
}