Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- l=0; r=n-1;
- bool nadjen=false;
- while(l<=r && nadjen==false)
- {
- mid=(l+r)/2;
- if( broj == niz[mid] ) nadjen=true;
- else if( broj<desni[mid] ) r=mid-1;
- else l=mid+1;
- }
- if(nadjen==true) { cnt=mid; while( niz[cnt]==niz[brd-1] ) cnt++; }
- else if( niz[l]<broj ) cnt=l+1;
- else cnt=l;
Add Comment
Please, Sign In to add comment