Cod sursa(job #1123474)
Utilizator | Data | 26 februarie 2014 08:39:37 | |
---|---|---|---|
Problema | Sortare prin comparare | Scor | 20 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.57 kb |
#include <fstream>
using namespace std;
int n,x[101],i,j,t;
int main ()
{
ifstream f("algsort.in");
ofstream g("algsort.out");
f>>n;
for(i=1;i<=n;i++)
{
f>>x[i];
}
for(i=1;i<=n-1;i++)
{
for(j=i+1;j<=n;j++)
{
if(x[j]<x[i])
{
t=x[i];
x[i]=x[j];
x[j]=t;
}
}
}
//Afisare
for(i=1;i<=n;i++)
g<<x[i]<<" ";
f.close();
g.close();
return 0;
}