Cod sursa(job #1868255)
| Utilizator | Data | 4 februarie 2017 18:51:48 | |
|---|---|---|---|
| Problema | Sortare prin comparare | Scor | 20 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.73 kb |
#include <cstdio>
using namespace std;
FILE *f=fopen("algsort.in","r"),*g=fopen("algsort.out","w");
int a[100],n,i;
void bubble_sort(int a[100],int n)
{
int i,aux,inv;
do
{
inv=1;
for(i=0;i<n;i++)
if(a[i]>a[i+1])
{
aux=a[i];
a[i]=a[i+1];
a[i+1]=aux;
inv=0;
}
}
while(!inv);
return;
}
int main()
{
fscanf(f,"%i",&n);
for(i=0;i<n;i++)
fscanf(f,"%i",&a[i]);
bubble_sort(a,n);
for(i=1;i<=n;i++)
fprintf(g,"%i ",a[i]);
fclose(f);
fclose(g);
return 0;
}
