Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- public static int binSearchRec(int x, int[] fallen, int from, int to) {
- if(to>=from){
- int middle=from+(to-from)/2;
- if(fallen[middle]==x) return middle+1; //pont a kozepso elem az --> kesz vagyunk
- if(fallen[middle]<x) return binSearchRec(x,fallen,from,middle-1); //nagyobb a kozepsonel --> a bal feleben keresunk tovabb
- return binSearchRec(x,fallen,middle+1,to); //kulonben a jobb feleben keresunk tovabb
- }
- return 0; //ha ide eljutott a vezerles, akkor x nincs benne a tombben, 0-t adunk vissza
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement