Cod sursa(job #1117588)
| Utilizator | Data | 23 februarie 2014 17:47:46 | |
|---|---|---|---|
| Problema | Sortare prin comparare | Scor | 40 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.49 kb |
#include <iostream>
#include<fstream>
using namespace std;
int main()
{
long int n,i,gasit,aux;
ifstream f("algsort.in");
ofstream g("algsort.out");
f>>n;
unsigned long long int v[n+2];
for(i=1;i<=n;i++)
{
f>>v[i];
}
do
{
gasit=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;
gasit=1;
}
}
while(gasit==1);
for(i=1;i<=n;i++)
{
g<<v[i]<<" ";
}
return 0;
}
