Cod sursa(job #2983968)
Utilizator | Data | 23 februarie 2023 12:47:55 | |
---|---|---|---|
Problema | Sortare prin comparare | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.5 kb |
#include <iostream>
#include <fstream>
using namespace std;
int main()
{ int n,v[500000], aux;
ifstream f("algsort.in");
ofstream g("algsort.out");
f>>n;
for(int i = 1; i<=n; i++)
{
f>>v[i];
}
for(int i=1;i<=n-1;i++)
{
if (v[i]>v[i+1])
{
aux = v[i+1];
v[i] = v[i+1];
v[i+1] = aux;
}
}
for (int i=1;i<=n;i++)
{
g<<v[i]<<" ";
}
return 0;
}