Cod sursa(job #1690648)
Utilizator | Data | 15 aprilie 2016 14:19:03 | |
---|---|---|---|
Problema | Sortare prin comparare | Scor | 40 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.35 kb |
#include <fstream>
using namespace std;
ifstream f("algsort.in");
ofstream g("algsort.out");
int n,i,j,x,a[500000];
int main()
{
f>>n;
for(i=1;i<=n;i++)
f>>a[i];
for(i=1;i<=n-1;i++)
for(j=1;j<=n-i;j++)
if(a[j]>a[j+1])
swap(a[j],a[j+1]);
for(i=1;i<=n;i++)
g<<a[i]<<" ";
return 0;
}