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

known how sorted binary search - java

Add Answer

Rudrakshi Gupta answered on July 22, 2022 Popularity 4/10 Helpfulness 2/10

answer known how sorted binary search - java

related binary search algorithm in java

related Java Binary Search

related java binary search

known how sorted binary search - java

Comment

int binarysearch(int arr[], int n, int k) {
        // code here
        int l = 0;
        int h = n-1;

        while(l<=h){
            int mid = l + ((h-l)/2);
            if(arr[mid]==k){
                return mid;
            }
            else if(arr[mid]<k){
                l = mid + 1;
            }
            else{
                h = mid - 1;
            }
        }
        return -1;
    
    }

Popularity 4/10 Helpfulness 2/10 Language java

Source: Grepper

Tags: binary-search java

Link to this answer
Share Copy Link

Contributed on Jan 15 2023

Rudrakshi Gupta

0 Answers Avg Quality 2/10

Closely Related Answers

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

known how sorted binary search - java

Contents

More Related Answers

known how sorted binary search - java

Closely Related Answers

binary search algorithm in java

Java Binary Search

java binary search

Grepper

Documentation

Social

Legal

Contact

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