Cod sursa(job #1984736)
| Utilizator | Data | 25 mai 2017 19:34:40 | |
|---|---|---|---|
| Problema | Sortare prin comparare | Scor | 40 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.46 kb |
#include <fstream>
using namespace std;
ifstream in("algsort.in");
ofstream out("algsort.out");
int main()
{
int n,v[500005],ok=0,i;
in>>n;
for(i=1; i<=n; i++)
in>>v[i];
while(ok==0)
{
ok=1;
for(i=1; i<=n-1; i++)
if(v[i]>v[i+1])
{
swap(v[i],v[i+1]);
ok=0;
}
}
for(int i=1; i<=n; i++) out<<v[i]<<' ';
return 0;
}
