Advertisement
Guest User

Untitled

a guest
May 27th, 2017
62
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
C 0.95 KB | None | 0 0
  1. #include <stdio.h>
  2.  
  3.  
  4. #define PRINT(f,x)  printf(""#x" = %"#f"\n", (x));
  5. #define PR2(x,n,y)  for (i=0; i<n; i++) printf(x,y[i]); printf("\n");
  6.  
  7. int n, rekur1(int), sort1(int,int*), a[]={69,44,12,55,42,94,28,6,67};
  8. int main()
  9. {  PRINT(d,n+3<<2+1);
  10.  
  11. {int n=27, (*fptr)(int);
  12.    fptr = rekur1; PRINT(d, (*fptr)(n>>1+1)); PRINT(x,n);
  13. }
  14. int (*fptr)(int, int*);
  15. fptr=sort1; PRINT(d, (*fptr)(1+n|2+4,a)); PRINT(d,3+n&1+4);
  16.  
  17.  
  18. }
  19. int rekur1 (int n)
  20. {  printf("Wywolanie z argumentem (%d)\n" ,n);
  21. if (n <= -7) return n;
  22. else return (rekur1(n-9>>1)+(n+1<<1)/2>>1);
  23.  }
  24.  
  25.  
  26. int sort1(int n, int *a)
  27. {  int i,j,k,m,p,x;
  28. PR2("%3d, ",n,a); m=1; p=k=n-1;
  29.    do
  30.      {
  31.       for(j=p-1; j>=m; j--)
  32.          if (a[j-1]>a[j])
  33.         { x=a[j-1]; a[j-1]=a[j]; a[j]=x; k=j;}
  34.       m=k+1;
  35.       for (j=1; j<=p; j++)
  36.     if (a[j-1]<a[j])
  37.        {x=a[j-1]; a[j-1]=a[j]; a[j]=x; k=j;}
  38.       p=k;
  39.       PR2("%3d, ",n,a);
  40.      }while (m<p); return(sizeof(a)/9);
  41.  }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement