Cod sursa(job #1117594)
Utilizator | Data | 23 februarie 2014 17:50:18 | |
---|---|---|---|
Problema | Sortare prin comparare | Scor | 40 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.47 kb |
#include <iostream>
#include<fstream>
using namespace std;
int main()
{
long int n,i,mini,k,aux,j;
ifstream f("algsort.in");
ofstream g("algsort.out");
f>>n;
unsigned long long int v[n+2];
for(i=1;i<=n;i++)
{
f>>v[i];
}
for(i=1;i<=n-1;i++)
{
mini=v[i];
k=i;
for(j=i+1;j<=n;j++)
if(v[j]<mini)
{
mini=v[j];
k=j;
}
aux=v[i];
v[i]=v[k];
v[k]=aux;
}
for(i=1;i<=n;i++)
{
g<<v[i]<<" ";
}
return 0;
}