Pagini recente » Cod sursa (job #1943813) | Cod sursa (job #710701) | Cod sursa (job #2442526) | Cod sursa (job #929797) | Cod sursa (job #1505601)
#include <iostream>
#include <fstream>
using namespace std;
int imin(int n,int i,int x[])
{
int j,min=i;
for(j=i+1;j<=n;j++)
if(x[j]<x[min])min=j;
return min;
}
void ordonez(int n,int x[])
{
int i,j,aux;
for(i=0;i<=n-2;i++)
{
j=imin(n,i,x);
aux=x[i];
x[i]=x[j];
x[j]=aux;
}
}
int main()
{
ifstream f("algsort.in");
ofstream g("algsort.out");
int n,i,x[500000];
long a;
f>>n;
for(i=1;i<=n;i++)
f>>x[i];
ordonez(n,x);
for(i=1;i<=n;i++)
g<<x[i]<<' ';
return 0;
}