Cod sursa(job #1679710)
| Utilizator | Data | 8 aprilie 2016 10:29:51 | |
|---|---|---|---|
| Problema | Sortare prin comparare | Scor | 40 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.53 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("algsort.in");
ofstream fout("algsort.out");
int v[500001],i,n,cont,sw;
int main()
{
fin>>n;
for(i=1;i<=n;i++)
fin>>v[i];
cont=0;
do{
sw=0;
for(i=1;i<n-cont;i++)
if(v[i]>v[i+1])
{
v[0]=v[i];
v[i]=v[i+1];
v[i+1]=v[0];
sw=1;
}
cont++;
}
while(sw==1);
for(i=1;i<=n;i++) fout<<v[i]<<" ";
return 0;
}
