Cod sursa(job #2618992)
| Utilizator | Data | 26 mai 2020 17:54:29 | |
|---|---|---|---|
| Problema | Sortare prin comparare | Scor | 40 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.59 kb |
#include <iostream>
#include <fstream>
using namespace std;
void bubblesort(int v[], int n)
{
int ok;
int i;
do
{
ok = 0;
for(i=0; i<n-1; i++)
if(v[i] > v[i+1])
{
ok = 1;
swap(v[i], v[i+1]);
}
n--;
}
while(ok == 1);
}
int main()
{
ifstream f("algsort.in");
ofstream g("algsort.out");
int n, i, v[500001];
f>>n;
for(i=0; i<n; i++)
f>>v[i];
bubblesort(v, n);
for(i=0; i<n; i++)
g<<v[i]<<" ";
return 0;
}
