Cod sursa(job #1234613)
| Utilizator | Data | 27 septembrie 2014 17:44:46 | |
|---|---|---|---|
| Problema | Sortare prin comparare | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.45 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("algsort.in");
ofstream g("algsort.out");
int i,j,n,v[500001];
bool ok;
int main()
{
f>>n;
for(i=1; i<=n; i++) f>>v[i];
for(i=1; i<=n; i++)
{
ok=false;
for(j=i; j<=n-1; j++)
if (v[j]<v[n]) { swap(v[i],v[j]); ok=true; break;}
if (ok==false) swap(v[i],v[n]);
}
for(i=1; i<=n; i++) g<<v[i]<<" ";
return 0;
}
