Cod sursa(job #662524)
| Utilizator | Data | 16 ianuarie 2012 19:39:12 | |
|---|---|---|---|
| Problema | Sortare prin comparare | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.53 kb |
#include <iostream.h>
#include <cstdio>
#include <conio.h>
#include <math.h>
using namespace std;
int main ()
{
freopen("algsort.in","r",stdin);
freopen("algsort.out","w",stdout);
int N,aux,ok,i;
cin>>N;
int v[N];
for(i=0;i<N;i++)
cin>>v[i];
ok=0;
while(ok==0)
{
ok=1;
for(i=0;i<N;i++)
{
if(v[i]>v[i+1])
{
aux=v[i];
v[i]=v[i+1];
v[i+1]=aux;
ok=0;
}
}
}
for(i=0;i<N;i++)
cout<<v[i]<<" ";
fclose(stdin);
fclose(stdout);
return 0;
}
