Cod sursa(job #2983985)
Utilizator | Data | 23 februarie 2023 13:05:38 | |
---|---|---|---|
Problema | Sortare prin comparare | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.58 kb |
#include <iostream>
#include<fstream>
using namespace std;
ifstream in("algsort.in");
ofstream out("aglsort.out");
int main()
{
int v[10000],i,ok,aux,n;
in>>n;
for (i=0;i<n;i++)
in>>v[i];
ok=0;
while(ok==0)
{
ok=1;
for (i=0;i<n-1;i++)
if(v[i]>v[i+1])
{
aux=v[i];
v[i]=v[i+1];
v[i+1]=aux;
ok=0;
}
}
for(i=0;i<n;i++)
out<<v[i]<<" ";
return 0;
}