Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- public int binSucheRekursiv(int[] pArray, int pZahl, int links, int rechts)
- {
- int mitte = (links + rechts)/2;
- if (links > rechts)
- return 0;
- else if (pArray[mitte] == pZahl)
- return mitte;
- else if (pArray[mitte] > pZahl)
- return binSucheRekursiv(pArray, pZahl, links, mitte--);
- else if (pArray[mitte] < pZahl)
- return binSucheRekursiv(pArray, pZahl, mitte++, rechts);
- else
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement