Cod sursa(job #796713)
Utilizator | skyper skyper96 | Data | 12 octombrie 2012 11:45:38 |
---|---|---|---|
Problema | Sortare prin comparare | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.65 kb |
#include <iostream>
#include <fstream>
using namespace std;
int main()
{
ifstream f("algsort.in");
ofstream g("algsort.out");
int N,i;
unsigned long x,aux;
f >> N;
int a[N-1];
bool y,z;
for (i=0;i<=N-1;i++)
f >> x;
z=1;
while (z==1)
{
i=0;
y=0;
while(a[i]>a[i+1])
{
aux=a[i];
a[i]=a[i+1];
a[i+1]=aux;
y=1;
if (i<N)
i++;
}
if(y=0)
z=0;
}
i=0;
while (i<N)
g << a[i] << " ";
f.close();
g.close();
return 0;
}