Cod sursa(job #1344197)
| Utilizator | Data | 16 februarie 2015 15:12:35 | |
|---|---|---|---|
| Problema | Sortare prin comparare | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.42 kb |
#include <fstream>
using namespace std;
ifstream in ("algsort.in");
ofstream out ("algsort.out");
int main()
{
long long v[10000],i,n,gasit,aux;
in>>n;
for(i=1;i<=n;i++)
in>>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++)
out<<v[i]<<" ";
return 0;
}
