Implement Recursive Binary Search - Java Data Structure

Java examples for Data Structure:Search

  1. HOME
  2. Java
  3. Data Structure
  4. Search

Description

Implement Recursive Binary Search

Demo Code

import java.util.*;
import java.util.stream.Collectors;


public class ImplementRecursiveBinarySearch {

    public static void main(String[] args) {

        Scanner scn = new Scanner(System.in);
        int searchedElement = scn.nextInt();
        scn.nextLine();//  w w  w .  j  av  a  2  s .c o  m
        String[] inputLine = scn.nextLine().split(" ");
        int size = inputLine.length;
        int[] numbers = new int[size];
        for (int i = 0; i < size; i++) {
            numbers[i] = Integer.parseInt(inputLine[i]);
        }
        System.out.println(binarySearch(numbers,searchedElement));
    }

    public static int binarySearch(int[] a, int target) {
        return binarySearch(a, 0, a.length-1, target);
    }

    public static int binarySearch(int[] a, int start, int end, int target) {
        int middle = (start + end) / 2;
        if(end < start) {
            return -1;
        }

        if(target==a[middle]) {
            return middle;
        } else if(target<a[middle]) {
            return binarySearch(a, start, middle - 1, target);
        } else {
            return binarySearch(a, middle + 1, end, target);
        }
    }

}

Related Tutorials