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

Java Searching Using binarySearch()

Add Answer

SAMER SAEID answered on December 7, 2020 Popularity 10/10 Helpfulness 2/10

answer Java Searching Using binarySearch()

related binary search in java

related Binary Search Java

related binary search java

related binary search algorithm in java

related Java Binary Search

related java binary search

related Binary Search java

Java Searching Using binarySearch()

Comment

import java.util.Collections;
import java.util.ArrayList;

class Main {
    public static void main(String[] args) {
        // Creating an ArrayList
        ArrayList<Integer> numbers = new ArrayList<>();
        numbers.add(1);
        numbers.add(2);
        numbers.add(3);

        // Using binarySearch()
        int pos = Collections.binarySearch(numbers, 3);
        System.out.println("The position of 3 is " + pos);
    }
}

Popularity 10/10 Helpfulness 2/10 Language java

Source: Grepper

Tags: java using

Link to this answer
Share Copy Link

Contributed on May 25 2022

SAMER SAEID

0 Answers Avg Quality 2/10

Closely Related Answers

binary search in java

Comment

public class BinarySearch {
    public static int binarySearch(int[] nums, int target) {
        int left = 0;
        int right = nums.length - 1;

        while (left <= right) {
            int mid = left + (right - left) / 2;

            if (nums[mid] == target) {
                return mid;
            }

            if (nums[mid] < target) {
                left = mid + 1;
            } else {
                right = mid - 1;
            }
        }

        return -1; // target not found
    }

    public static void main(String[] args) {
        int[] nums = {1, 2, 3, 4, 5, 6, 7, 8, 9};
        int target = 6;

        int index = binarySearch(nums, target);

        if (index != -1) {
            System.out.println("Target found at index " + index);
        } else {
            System.out.println("Target not found");
        }
    }
}

Popularity 8/10 Helpfulness 3/10 Language java

Source: Grepper

Link to this answer
Share Copy Link

Contributed on Sep 12 2023

YOU.com

0 Answers Avg Quality 2/10

Binary Search Java

Comment

// Java implementation of recursive Binary Search
class BinarySearch {
    // Returns index of x if it is present in arr[l..
    // r], else return -1
    int binarySearch(int arr[], int l, int r, int x)
    {
        if (r >= l) {
            int mid = l + (r - l) / 2;
  
            // If the element is present at the
            // middle itself
            if (arr[mid] == x)
                return mid;
  
            // If element is smaller than mid, then
            // it can only be present in left subarray
            if (arr[mid] > x)
                return binarySearch(arr, l, mid - 1, x);
  
            // Else the element can only be present
            // in right subarray
            return binarySearch(arr, mid + 1, r, x);
        }
  
        // We reach here when element is not present
        // in array
        return -1;
    }
  
    // Driver method to test above
    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);
    }
}
/* This code is contributed by Rajat Mishra */

Popularity 9/10 Helpfulness 3/10 Language java

Source: www.geeksforgeeks.org

Tags: binary-search bi

Link to this answer
Share Copy Link

Contributed on Jul 31 2022

Tired Toad

0 Answers Avg Quality 2/10

binary search java

Comment

public int runBinarySearchRecursively(
  int[] sortedArray, int key, int low, int high) {
    int middle = (low + high) / 2;
        
    if (high < low) {
        return -1;
    }

    if (key == sortedArray[middle]) {
        return middle;
    } else if (key < sortedArray[middle]) {
        return runBinarySearchRecursively(
          sortedArray, key, low, middle - 1);
    } else {
        return runBinarySearchRecursively(
          sortedArray, key, middle + 1, high);
    }
}

Popularity 10/10 Helpfulness 3/10 Language java

Source: www.baeldung.com

Tags: binary-search bi

Link to this answer
Share Copy Link

Contributed on Dec 07 2020

Yabaduga

0 Answers Avg Quality 2/10

binary search java

Comment

import java.util.*;
public class array
{
    static Scanner sc=new Scanner(System.in);
    public static void main(String[] args)
    {
        System.out.println("Enter the number of elements in the array:");
        int x=sc.nextInt();
        int arr[]=new int[x];
        System.out.println("Enter the sorted elements in the array:");
        for(int i=0; i<arr.length; i++)
        {
            arr[i]=sc.nextInt();
        }
        System.out.println("Enter the element to be searched for in the array:");
        int y=sc.nextInt();
        int max=arr.length-1;
        int min=0;
        int mid;
        while(max>=min)
        {
            mid=(min+max)/2;
            if(y==arr[mid])
            {
                System.out.println("The requested element is at index "+mid);
                break;
            }
            else if(y>arr[mid])
                min=mid+1;
            else if(y<arr[mid])
                max=mid-1;
            if(min>max)
                System.out.println("Requested element is not in the array.");
        }
    }
}

Popularity 9/10 Helpfulness 3/10 Language java

Source: Grepper

Tags: binary-search bi

Link to this answer
Share Copy Link

Contributed on May 18 2022

Chaitanya Mishra

0 Answers Avg Quality 2/10

binary search java

Comment

/*
Java Implementation of Binary Search Algorithm.
- Assuming the Array is Sorted (Ascending Order)
- returns the Index, if Element found.
- -1, if not found.
*/
public class BinarySearch {

    int binarysearch(int[] array, int element) {
        int a_pointer = 0;
        int b_pointer = array.length -1;
      	if (array[a_pointer] == element) return a_pointer;
        if (array[b_pointer] == element) return b_pointer;

        while(a_pointer <= b_pointer){
            int midpoint = a_pointer + (b_pointer - a_pointer) / 2;
          	if (array[midpoint] == element) return midpoint;
          
          	// ignoring the left half, if this is True.
            if (array[midpoint] < element) a_pointer = midpoint + 1;
          
          	// ignoring the right half, if this is True.
            else if (array[midpoint] > element) b_pointer = midpoint - 1;
        }
        return -1;	// Element not Found
    }
    public static void main(String[] args) {
        int[] list = {1, 2, 3, 4, 7, 9, 11, 12, 15, 19, 23, 36, 54, 87};
        System.out.println(binarysearch(list, 19));
    }
}

Popularity 10/10 Helpfulness 2/10 Language java

Source: Grepper

Tags: algorithm algo

Link to this answer
Share Copy Link

Contributed on Jan 09 2022

Prabhu Kiran Konda

0 Answers Avg Quality 2/10

binary search algorithm in java

Comment

//
// Source code recreated from a .class file by IntelliJ IDEA
// (powered by FernFlower decompiler)
//

package com.SortingAlgorithm;

import java.util.Scanner;

public class BinarySearch {
    public BinarySearch() {
    }
    
  // write a function that performs your binary search.
    static int binarySearch(int[] arr, int target, int n) {
      // declare your right and left pointers.
        int lp = 0; 
        int rp = n - 1;
      
  // write loop that compares the left & right pointers and returns the mid point
        while(lp <= rp) {
            int mid = (lp + rp) / 2;
            if (target == arr[mid]) {
                return mid;
            }
// write an if statement to check for target element at mid point
            if (target < arr[mid]) {
                rp = mid - 1;
            } else {
                lp = mid + 1;
            }
        }

        return -1;
    }
  
// driver method to test the above
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int target = false;
        System.out.print("Enter the number of elements tou on the array list! :");
        int n = scanner.nextInt();
        int[] arr = new int[n];
        System.out.println("enter " + n + " Elements");

        for(int i = 0; i < n; ++i) {
            arr[i] = scanner.nextInt();
        }

        System.out.println("Enter target value: ");
        int target = scanner.nextInt();
        int index = binarySearch(arr, target, n);
        if (index != -1) {
            System.out.println("Element is at index: " + index);
        } else {
            System.out.format("Element not found");
        }

    }
}

Popularity 9/10 Helpfulness 2/10 Language java

Source: Grepper

Tags: algorithm algo

Link to this answer
Share Copy Link

Contributed on Jul 22 2022

Emmanuel Aniah

0 Answers Avg Quality 2/10

Java Binary Search

Comment

// Java Binary Search Algorithm
// ----------------------------

/* 
   Time Complexity
     Best Time Complexity:O(1)
	 Average Time Complexity:O(log n)
	 Worst Time Complexity:O(log n)
     
   Space Complexity
     No auxiliary space is required in Linear Search implementation.
	 Hence space complexity is:O(1)
*/

public class BinarySearch {

    // Searching using Recursive approach
    public static int Search(int arr[], int value, int start, int end) {
        int center = (start + end) / 2;

        if (start <= end) {
            if (value == center) {
                return center;
            }

            if (value < center) {
                return Search(arr, value, start, center - 1);
            }

            if (value > center) {
                return Search(arr, value, center + 1, end);
            }
        }

        return -1;
    }

    public static void main(String[] args) {
        int arr[] = new int[] { 1, 2, 3, 4, 5, 6, 7, 8, 9 };

        int Index = Search(arr, 9, 0, arr.length);
        if (Index == -1) {
            System.out.println("Value Not Found");
        } else {
            System.out.println("Value found at Index: " + Index);
        }
    }
}

Popularity 10/10 Helpfulness 2/10 Language java

Source: Grepper

Tags: algorithm algo

Link to this answer
Share Copy Link

Contributed on Aug 19 2022

Wild Wolverine

0 Answers Avg Quality 2/10

java binary search

Comment

import java.util.*;

public class Search {
    static int indexOfItem(List<String> list, String target) {
        int first = 0;
        int last = list.size() - 1;
        while (first <= last) {
            int midpoint = (first + last) / 2;
            int comparisonResult = list.get(midpoint).compareTo(target);
            if (comparisonResult == 0) {
                return midpoint;
            } else if (comparisonResult < 0) {
                first = midpoint + 1;
            } else {
                last = midpoint - 1;
            }
        }
        // We have to return an integer, so return an "impossible"
        // index to indicate value was not found.
        return -1;
    }

    public static void main(String[] args) {
        // Note that the list is sorted this time!
        ArrayList<String> list = new ArrayList<String>(
            Arrays.asList("Elida Sleight", "Francina Vigneault", "Lucie Hansman", "Nancie Rubalcaba"));
        System.out.println(indexOfItem(list, "Lucie Hansman"));
    }
}

Popularity 9/10 Helpfulness 2/10 Language java

Source: teamtreehouse.com

Tags: binary-search bi

Link to this answer
Share Copy Link

Contributed on Nov 11 2022

Xanthous Xenomorph

0 Answers Avg Quality 2/10

Binary Search java

Comment

package com.community.java;
/**
 * 
 * @author Akira
 */
public class ContohBinarySearch {
    private final int [] data = {5, 9, 12, 15, 17, 23, 27, 38, 42, 54, 64, 78, 90};
    
    private void tampilData(){
        for (int i : data) {
            System.out.print(i+" ");
        }
        System.out.println();
    }
    
    public String pencarianBinary(int key) {
        int bawah = 0;
        int atas = data.length - 1;

        while (atas >= bawah) {
            int tengah = (bawah + atas) / 2;
            if (key < data[tengah]){
                atas = tengah - 1;
            } else if (key == data[tengah]){
                return "Nomor "+key+" Berada Pada Urutan Ke - "+(tengah+1);
            }else{
                bawah = tengah + 1;
            }
        }
        return "Data Tidak Ditemukan";
    }
 
    public static void main(String args []){
        ContohBinarySearch obj = new ContohBinarySearch();
        obj.tampilData();
        System.out.println(obj.pencarianBinary(8));
    }

}

Popularity 9/10 Helpfulness 1/10 Language java

Source: www.community-java.com

Tags: binary-search bi

Link to this answer
Share Copy Link

Contributed on Oct 18 2022

Muhammad Zainal Muttaqin

0 Answers Avg Quality 2/10

Java Searching Using binarySearch()

Contents

More Related Answers

Java Searching Using binarySearch()

Closely Related Answers

binary search in java

Binary Search Java

binary search java

binary search java

binary search java

binary search algorithm in java

Java Binary Search

java binary search

Binary Search java

Grepper

Documentation

Social

Legal

Contact

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