Advertisement
Guest User

mica3

a guest
Sep 1st, 2014
186
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 0.69 KB | None | 0 0
  1. #include <stdio.h>
  2. #include <math.h>
  3. #include <stdlib.h>
  4.  
  5. int pored(int,int);
  6.  
  7. int main(){
  8. int niz[10],i,n;
  9. printf("Unesite koliko clanova ima niz:");
  10. scanf("%d", &n);
  11. for(i=0; i<n; i++)
  12. {
  13. printf("Niz[%d]=", i);
  14. scanf("%d", &niz[i]);
  15. }
  16. if(pored(niz, n)==0)
  17. printf("Elementi niza su poredani u monotono neopadajucem poretku!\n");
  18. else
  19. printf("Elementi niza nisu poredani u monotono neopadajucem poretku!\n");
  20. return 0;
  21. }
  22.  
  23. int pored(int niz,int n){
  24. int *b;
  25. b=niz;
  26. int i,s=0;
  27. for(i=0; i<n; i++)
  28. {
  29. if(b[i+1]<b[i])
  30. s++;
  31. }
  32. return(s);
  33. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement