java  Given Array : ARRAY[] = [11, 21, 33, 40, 50] Write a full and complete recursive implementation of the Binary Search Algorithm such that you find your target element 21 in O(log2(n)) time complexity overall and O(1) space complexity. Here, n is the length of the list of input integers (array). We will not be considering any memory used by recursion.

Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
icon
Related questions
Question

java 

Given Array :
ARRAY[] = [11, 21, 33, 40, 50]
Write a full and complete recursive implementation of the Binary Search
Algorithm such that you find your target element 21 in O(log2(n)) time
complexity overall and O(1) space complexity. Here, n is the length of
the list of input integers (array). We will not be considering any memory
used by recursion. 

Expert Solution
Step 1

Task :- Write a Java code to implement binary search.

 

Java code :- 

 

import java.io.*;

class Main {
    public static int binarySearch(int[] arr, int low, int high, int target) {
        if(low > high)
            return -1;

        int mid = (low+high)/2;
        if(arr[mid]==target)
            return mid;
        if(arr[mid] > target)
            // search in left half
            return binarySearch(arr,low,mid-1,target);
        else
            // search in right half
            return binarySearch(arr,mid+1,high,target);
    }
    public static void main(String[] args) {
        int[] arr = {11,21,33,40,50};
        int index = binarySearch(arr,0,arr.length-1,21);
        if(index==-1)
            System.out.println("target is not found in given array.");
        else
            System.out.println("target is found at index " + index);
    }
}

 

trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps with 1 images

Blurred answer
Knowledge Booster
Randomized Select Algorithm
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education