Pagini recente » Cod sursa (job #1197550) | Cod sursa (job #1201824) | Cod sursa (job #1225147) | Cod sursa (job #1675930) | Cod sursa (job #1149534)
#include <stdio.h>
#include <stdlib.h>
#include <math.h>
long unsigned n,i,a[30],flag,man,k,c;
int main()
{
FILE*f=fopen("algsort.in","r");
FILE*g=fopen("algsort.out","w");
fscanf(f,"%lu",&n);
for(i=0;i<n;i++) fscanf(f,"%lu",&a[i]);
printf("\n");
//Sortare
while(flag==0)
{
flag=1;
for(i=1;i<n/2+n%2;i++)
if(a[i]<a[i-1])
{
flag=0;
man=a[i];
a[i]=a[i-1];
a[i-1]=man;
}
for(i=n/2+n%2+1;i<n;i++)
if(a[i]<a[i-1])
{
flag=0;
man=a[i];
a[i]=a[i-1];
a[i-1]=man;
}
}
while(flag==0)
{
flag=1;
for(i=1;i<n;i++)
if(a[i]<a[i-1])
{
flag=0;
man=a[i];
a[i]=a[i-1];
a[i-1]=man;
}
}
//
for(i=0;i<n;i++) fprintf(g,"%lu ",a[i]);
fclose(f);
fclose(g);
return 0;
}