Cod sursa(job #943303)
Utilizator | Data | 24 aprilie 2013 21:36:35 | |
---|---|---|---|
Problema | Sortare prin comparare | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.32 kb |
#include<fstream>
using namespace std;
int main()
{long long a[200000],ok=1,n,i,j,aux;
ifstream f("algsort.in");
ofstream g("algsort.out");
f>>n;
for(i=1;i<=n;i++)
{f>>a[i];}
while(ok==1)
{ok=0;
for(i=1;i<=n-1;i++)
{if(a[i]>a[i+1])
{aux=a[i];
a[i]=a[i+1];
a[j]=aux;
ok=1;}}}
for(i=1;i<=n;i++)
{g<<a[i]<<" ";}}