Cod sursa(job #1235782)
| Utilizator | Data | 30 septembrie 2014 17:39:15 | |
|---|---|---|---|
| Problema | Sortare prin comparare | Scor | 40 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.7 kb |
#include <iostream>
#include <fstream>
#define nmax 1000
using namespace std;
int v[nmax];
int i, k, n, aux;
bool ord;
int main ()
{
ifstream f("algsort.in");
ofstream g("algsort.out");
f >> n;
for(i=1; i<=n; i++)
{
f >> v[i];
}
k = 0;
do
{
ord = false;
k++;
for(i=1; i<=n-k; i++)
{
if(v[i] > v[i+1])
{
ord = true;
aux = v[i];
v[i] = v[i+1];
v[i+1] = aux;
}
}
}while(ord != false);
for(i=1; i<=n; i++)
{
g << v[i] << " ";
}
f.close();
g.close();
}
