Cod sursa(job #2983944)
Utilizator | Data | 23 februarie 2023 12:26:06 | |
---|---|---|---|
Problema | Sortare prin comparare | Scor | 40 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.5 kb |
#include <iostream>
#include <fstream>
using namespace std;
int main()
{
ifstream f1 ("algsort.in");
ofstream f2 ("algsort.out");
int n,i,cnt=1;
f1>>n;
int v[n];
for (i=0; i<n; i++)
f1>>v[i];
while (cnt!=0)
{
cnt=0;
for (i=0; i<n-1; i++)
if (v[i]>v[i+1])
{
swap(v[i],v[i+1]);
cnt++;
}
}
for (i=0; i<n; i++)
f2<<v[i]<< " ";
return 0;
}