Cod sursa(job #1253817)
Utilizator | Data | 1 noiembrie 2014 20:41:42 | |
---|---|---|---|
Problema | Sortare prin comparare | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.57 kb |
#include <iostream>
//selection
using namespace std;
int main()
{
int a[50], i, n, aux,q, m, imin,j;
cin>>n; m=n;
for(i=0;i<n;i++)
cin>>a[i];
for(j=0; j<n-1; j++)
{
imin=j;
for(i=j+1; i<n; i++)
if(a[i]<a[imin])
imin=i;
if(imin!=j)
{
aux=a[j];
a[j]=a[imin];
a[imin]=aux;
}
}
for(i=0;i<m;i++)
cout<<a[i]<<" ";
return 0;
}