Cod sursa(job #1647101)
Utilizator | Data | 10 martie 2016 19:02:24 | |
---|---|---|---|
Problema | Sortare prin comparare | Scor | 40 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.5 kb |
#include <fstream>
using namespace std;
ifstream f("algsort.in");
ofstream g("algsort.out");
int x[500001];
int main()
{
int n,i,aux;
f>>n;
for(i=1;i<=n;i++)
f>>x[i];
int t=0;
while(t==0)
{
t=1;
for(i=1;i<=n-1;i++)
if(x[i]>x[i+1])
{
aux=x[i];
x[i]=x[i+1];
x[i+1]=aux;
t=0;
}
}
for(i=1;i<=n;i++)
g<<x[i]<<" ";
return 0;
}