Cod sursa(job #1510209)
Utilizator | Data | 24 octombrie 2015 18:03:30 | |
---|---|---|---|
Problema | Sortare prin comparare | Scor | 40 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.55 kb |
#include <fstream>
using namespace std;
int main()
{
ifstream f("algsort.in");
ofstream g("algsort.out");
int i,n,ok,aux;
f>>n;
int v[n+1];
for(i=1;i<=n;i++)
f>>v[i];
do
{
ok=0;
for(i=1;i<n;i++)
if(v[i]>v[i+1])
{
aux=v[i];
v[i]=v[i+1];
v[i+1]=aux;
ok=1;
}
}
while(ok);
for(i=1;i<=n;i++)
g<<v[i]<<" ";
f.close();
g.close();
return 0;
}