Cod sursa(job #3125152)
Utilizator | Data | 2 mai 2023 09:50:48 | |
---|---|---|---|
Problema | Sortare prin comparare | Scor | 40 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.49 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("algsort.in");
ofstream g("algsort.out");
int v[500005],n;
bool ok;
int main()
{
f>>n;
for(int i=1; i<=n; i++)
f>>v[i];
do
{
ok=1;
for(int i=1; i<n; i++)
if(v[i]>v[i+1])
{
swap(v[i],v[i+1]);
ok=0;
}
}
while(ok==0);
for(int i=1; i<=n; i++)
g<<v[i]<<' ';
return 0;
}