Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <stdio.h>
- #define PRINT(f,x) printf(""#x" = %"#f"\n", (x));
- #define PR2(x,n,y) for (i=0; i<n; i++) printf(x,y[i]); printf("\n");
- int n, rekur1(int), sort1(int,int*), a[]={69,44,12,55,42,94,28,6,67};
- int main()
- { PRINT(d,n+3<<2+1);
- {int n=27, (*fptr)(int);
- fptr = rekur1; PRINT(d, (*fptr)(n>>1+1)); PRINT(x,n);
- }
- int (*fptr)(int, int*);
- fptr=sort1; PRINT(d, (*fptr)(1+n|2+4,a)); PRINT(d,3+n&1+4);
- }
- int rekur1 (int n)
- { printf("Wywolanie z argumentem (%d)\n" ,n);
- if (n <= -7) return n;
- else return (rekur1(n-9>>1)+(n+1<<1)/2>>1);
- }
- int sort1(int n, int *a)
- { int i,j,k,m,p,x;
- PR2("%3d, ",n,a); m=1; p=k=n-1;
- do
- {
- for(j=p-1; j>=m; j--)
- if (a[j-1]>a[j])
- { x=a[j-1]; a[j-1]=a[j]; a[j]=x; k=j;}
- m=k+1;
- for (j=1; j<=p; j++)
- if (a[j-1]<a[j])
- {x=a[j-1]; a[j-1]=a[j]; a[j]=x; k=j;}
- p=k;
- PR2("%3d, ",n,a);
- }while (m<p); return(sizeof(a)/9);
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement