Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <stdio.h>
- #include <math.h>
- #include <stdlib.h>
- int pored(int,int);
- int main(){
- int niz[10],i,n;
- printf("Unesite koliko clanova ima niz:");
- scanf("%d", &n);
- for(i=0; i<n; i++)
- {
- printf("Niz[%d]=", i);
- scanf("%d", &niz[i]);
- }
- if(pored(niz, n)==0)
- printf("Elementi niza su poredani u monotono neopadajucem poretku!\n");
- else
- printf("Elementi niza nisu poredani u monotono neopadajucem poretku!\n");
- return 0;
- }
- int pored(int niz,int n){
- int *b;
- b=niz;
- int i,s=0;
- for(i=0; i<n; i++)
- {
- if(b[i+1]<b[i])
- s++;
- }
- return(s);
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement