Cod sursa(job #1459298)
Utilizator | Data | 9 iulie 2015 15:38:18 | |
---|---|---|---|
Problema | Sortare prin comparare | Scor | 40 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.5 kb |
#include <fstream>
#define nmax 500001
using namespace std;
int main()
{
int n,i,ok;
long a[nmax];
ifstream f ("algsort.in");
ofstream g ("algsort.out");
f>>n;
for (int i=1;i<=n;i++)
f>>a[i];
do {
ok=0;
for (i=1;i<=n;i++)
{
if (a[i-1]>a[i]){
swap(a[i-1],a[i]);
ok=1;
}}
}while (ok);
for (int i=1;i<=n;i++)
g<<a[i]<<" ";
return 0;
}