Pagini recente » Cod sursa (job #3135044) | Cod sursa (job #1915260) | Cod sursa (job #443807) | Cod sursa (job #1886192) | Cod sursa (job #1234613)
#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;
}