Cod sursa(job #1257507)
| Utilizator | Data | 7 noiembrie 2014 20:35:51 | |
|---|---|---|---|
| Problema | Sortare prin comparare | Scor | 20 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.57 kb |
#include <iostream>
#include<fstream>
using namespace std;
int main()
{
int v[100], n, i, min, pmin,j;
ifstream f("algsort.in");
f>>n;
for(i=1; i<=n; i++)
f>>v[i];
for(i=1; i<n; i++)
{
min=v[i];
pmin=i;
for(j=i+1; j<=n; j++)
if(v[j]<min)
{
min=v[j];
pmin=j;
}
v[pmin]=v[i];
v[i]=min;
}
ofstream g("algsort.out");
for(i=1; i<=n; i++)
g<<v[i]<<" ";
}
