Cod sursa(job #2252180)
| Utilizator | Data | 2 octombrie 2018 13:53:18 | |
|---|---|---|---|
| Problema | Sortare prin comparare | Scor | 40 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.53 kb |
#include <fstream>
using namespace std;
int v[500001];
ifstream fin("algsort.in");
ofstream fout("algsort.out");
void Sortare(int n,int v[])
{
int ok=0;
while (ok==0)
{
ok=1;
for (int i=0;i<n-1;i++)
if (v[i]>v[i+1])
{
swap(v[i],v[i+1]);
ok=0;
}
}
}
int main()
{
int n,i;
fin>>n;
for (i=0;i<n;i++)
fin>>v[i];
Sortare(n,v);
for (i=0;i<n;i++)
fout<<v[i]<<" ";
return 0;
}
