Binary Search Top Interview Problems

Mukesh Yadav — Sun, 19 May 2024 05:52:07 +0000

`// Java implementation of iterative Binary Search

import java.io.*;

class BinarySearch {

// Returns index of x if it is present in arr[].
int binarySearch(int arr[], int x)
{
    int low = 0, high = arr.length - 1;
    while (low <= high) {
        int mid = low + (high - low) / 2;

        // Check if x is present at mid
        if (arr[mid] == x)
            return mid;

        // If x greater, ignore left half
        if (arr[mid] < x)
            low = mid + 1;

        // If x is smaller, ignore right half
        else
            high = mid - 1;
    }

    // If we reach here, then element was
    // not present
    return -1;
}

// Driver code
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, x);
    if (result == -1)
        System.out.println(
            "Element is not present in array");
    else
        System.out.println("Element is present at "
                           + "index " + result);
}

}
`

Searching Alogirthms

Mukesh Yadav — Mon, 22 Aug 2022 17:20:26 +0000

*1. Linear Search *
` public static int search(int arr[], int x)
{
int n = arr.length;
for (int i = 0; i < n; i++)
{
if (arr[i] == x)
return i;
}
return -1;
}

// Driver code
public static void main(String args[])
{
    int arr[] = { 2, 3, 4, 10, 40 };
    int x = 10;

    // Function call
    int result = search(arr, x);
    if (result == -1)
        System.out.print(
            "Element is not present in array");
    else
        System.out.print("Element is present at index "
                         + result);
}`

Binary search

it is faster than linear search

DEV Community: Mukesh Yadav

Binary Search Top Interview Problems

Searching Alogirthms