Advertisement
MikecIT

Vezba 11 - 6.

Nov 30th, 2014
183
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
C 0.74 KB | None | 0 0
  1. #include <stdio.h>
  2. #include <stdlib.h>
  3.  
  4. unsigned max(int x[], int n);
  5.  
  6. unsigned ciklpom(int n, int x[]);
  7.  
  8. int main()
  9. {
  10.     int n, x[41], i, k,y;
  11.     printf("Unesite n: ");
  12.     scanf("%d",&n);
  13.     printf("Unesite niz\n");
  14.     for(i=0;i<n;i++) x[i]=0;
  15.     for(i=0;i<n;i++)
  16.     {
  17.         printf("X[%d]=",i+1);
  18.         scanf("%d",&x[i]);
  19.     }
  20.     y=ciklpom(n,x);
  21.     printf("Novi niz: ");
  22.     for(i=0;i<n-y;i++)
  23.         printf("%d ",x[i]);
  24.     return 0;
  25. }
  26.  
  27. unsigned ciklpom(int n, int x[])
  28. {
  29.     int i, poz;
  30.     poz=max(x,n);
  31.     for(i=0;i<n-poz;i++)
  32.         x[i]=x[i+poz];
  33.  
  34.     return poz;
  35. }
  36.  
  37. unsigned max(int x[], int n)
  38. {
  39.     int max=x[0], maxi=0, i;
  40.     for(i=0;i<n;i++) if(x[i]>max) maxi=i,max=[x];
  41.  
  42.     return maxi;
  43. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement