Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- int trazi (int a[], int i, int j){
- if (i>j) return -1;
- int p,k,s,pocetni ;
- p=i; k=j; pocetni=i;
- while(p<=k){
- s=(p+k)/2;
- if(a[s]==a[pocetni]) return s-pocetni;
- if(a[s] > a[pocetni] ) p = s+1;
- if(a[s] < a[pocetni] ){
- if(s-1!=0 && a[s-1]<a[s]) {k=s-1;}
- else if (s-1!=0 && a[s-1]>a[s]) {return s-pocetni;
- }
- }
- }
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement