Breaking News: Grepper is joining You.com. Read the official announcement!

java recursive binary search

Add Answer

Xanthous Xenomorph answered on October 6, 2022 Popularity 9/10 Helpfulness 6/10

answer java recursive binary search

related java binary search recursive

related Java implementation of recursive Binary Search

java recursive binary search

Comment

public class RecursiveBinarySearch {
    public static int binarySearch(int[] input, int target, int start, int end) {
        if (start >= end) {
            return -1;
        } else {
            int mid = start + (end - start) / 2;

            if (target < input[mid]) {
                return binarySearch(input, target, start, mid-1);
            } else if (target > input[mid]) {
                return binarySearch(input, target, mid+1, end);
            } else {
                return mid;
            }
        }
    }
}

Popularity 9/10 Helpfulness 6/10 Language java

Source: teamtreehouse.com

Tags: binary-search java

Link to this answer
Share Copy Link

Contributed on Nov 11 2022

Xanthous Xenomorph

0 Answers Avg Quality 2/10

Closely Related Answers

java binary search recursive

Comment

private static boolean binarySearch(int[] pool, int target) {
		int left = 0, right = pool.length - 1;
		int middle;
		boolean found = false;

		while(!found && left <= right) {
			middle = left + (right - left) / 2;
			if(pool[middle] == target) {
				found = true;
			} else if(pool[middle] < target) {
				left = middle + 1;
			} else {
				right = middle - 1;
			}
		}

Popularity 9/10 Helpfulness 3/10 Language java

Source: Grepper

Tags: java binary-search bin

Link to this answer
Share Copy Link

Contributed on Oct 06 2022

Steven2003

0 Answers Avg Quality 2/10

Java implementation of recursive Binary Search

Comment

class BinarySearch {
    int binarySearch(int arr[], int l, int r, int x) {
        if (r>=l) {
            int mid = l + (r - l)/2;
            if (arr[mid] == x)
               return mid;

            if (arr[mid] > x)
               return binarySearch(arr, l, mid-1, x);

            return binarySearch(arr, mid+1, r, x);
        }
        return -1;
    }

    public static void main(String args[]) {
        BinarySearch ob = new BinarySearch();
        int arr[] = {2,3,4,10,40};
        int n = arr.length;
        int x = 10;
        int result = ob.binarySearch(arr,0,n-1,x);
        if (result == -1)
            System.out.println("Element not present");
        else
            System.out.println("Element found at index " + result);
    }
}

Popularity 3/10 Helpfulness 1/10 Language java

Source: zipcoder.github.io

Tags: implementation binary-search java

Link to this answer
Share Copy Link

Contributed on Mar 08 2024

Nathan Eckel

0 Answers Avg Quality 2/10

java recursive binary search

Contents

More Related Answers

java recursive binary search

Closely Related Answers

java binary search recursive

Java implementation of recursive Binary Search

Grepper

Documentation

Social

Legal

Contact

Oops, You will need to install Grepper and log-in to perform this action.