Cod sursa(job #535108)
| Utilizator | Data | 16 februarie 2011 19:42:21 | |
|---|---|---|---|
| Problema | Sortare prin comparare | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.56 kb |
#include<fstream>
using namespace std;
int main (void)
{
ifstream f("algsort.in");
ofstream g("algsort.out");
int n,u,j,v[100], aux,i;
f>>n;
for(i=1;i<=n;i++)
f>>v[i];
for(i=1;i<=n-1;i++)
for(j=i+1;j<=n;j++)
if(v[i]>v[j])
{
aux=v[i];
v[i]=v[j];
v[j]=aux;
}
g<<"vectorul sortat este :"<<endl;
for(i=1;i<=n;i++)
g<<" "<<v[i];
f.close ();
g.close ();
}
