Cod sursa(job #654117)
| Utilizator | Data | 29 decembrie 2011 16:39:28 | |
|---|---|---|---|
| Problema | Sortare prin comparare | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.36 kb |
#include<iostream.h>
#include<fstream.h>
void compsort(int a[40],int n)
{int i,j,aux;
for(i=0;i<n-1;i++)
for(j=i+1;j<n;j++)
if(a[i]>a[j])
{aux=a[i];
a[i]=a[j];
a[j]=aux;}}
main()
{int n,i,v[40];
ifstream f("algsort.in");
ofstream g("algsort.out");
f>>n;
for(i=0;i<n;i++)
{f>>v[i];}
compsort(v,n);
for(i=0;i<n;i++)
g<<v[i];}
