Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #binary search pagerintas
- private static boolean binarySearch(int[] array, int beginning, int end, int searchedValue) {
- while (beginning <= end) {
- int middleIndex = (beginning + end) / 2;
- int middleValue = array[middleIndex];
- if (middleValue == searchedValue || array[end] == searchedValue) {
- return true;
- }
- if (end-beginning==1 && middleValue != searchedValue){
- return false;
- }
- if (searchedValue > middleValue) {
- beginning = middleIndex;
- return binarySearch(array, beginning+1, end, searchedValue);
- } else if (searchedValue < middleValue) {
- end = middleIndex;
- return binarySearch(array, beginning, end-1, searchedValue);
- }
- }
- return false;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement