Binary Search Target Index

Like9

Given a sorted array of integers in ascending order and a target value, write a function to find the index of the target value in the array using binary search. If the target is not present in the array, return -1.

Problem Details: The input array is guaranteed to be sorted in ascending order with no duplicate elements. Your task is to implement a binary search algorithm to locate the target value efficiently. Binary search works by repeatedly dividing the search interval in half. If the target value is found, return its index; otherwise, return -1. The solution should handle edge cases, such as an empty array or a target value not present in the array.

Algorithm Flow

Recommendation Algorithm Flow for Binary Search Target Index - Budibadu

Best Answers

java

class Solution {
    public int search(Object nums, Object target) {
        int[] arr = (int[]) nums;
        int t = (int) target;
        int left = 0;
        int right = arr.length - 1;
        
        while (left <= right) {
            int mid = left + (right - left) / 2;
            if (arr[mid] == t) {
                return mid;
            } else if (arr[mid] < t) {
                left = mid + 1;
            } else {
                right = mid - 1;
            }
        }
        return -1;
    }
}

javascript

function search(nums, target) {
    let left = 0;
    let right = nums.length - 1;
    
    while (left <= right) {
        const mid = Math.floor(left + (right - left) / 2);
        if (nums[mid] === target) {
            return mid;
        } else if (nums[mid] < target) {
            left = mid + 1;
        } else {
            right = mid - 1;
        }
    }
    return -1;
}

php

<?php
function search($nums, $target) {
    $left = 0;
    $right = count($nums) - 1;
    
    while ($left <= $right) {
        $mid = $left + intval(($right - $left) / 2);
        if ($nums[$mid] == $target) {
            return $mid;
        } else if ($nums[$mid] < $target) {
            $left = $mid + 1;
        } else {
            $right = $mid - 1;
        }
    }
    return -1;
}

python

from typing import List

def search(nums: List[int], target: int) -> int:
    left, right = 0, len(nums) - 1
    while left <= right:
        mid = left + (right - left) // 2
        if nums[mid] == target:
            return mid
        elif nums[mid] < target:
            left = mid + 1
        else:
            right = mid - 1
    return -1

rust

fn search(nums: Vec<i32>, target: i32) -> i32 {
    let mut left = 0;
    let mut right = nums.len() as i32 - 1;
    
    while left <= right {
        let mid = left + (right - left) / 2;
        if nums[mid as usize] == target {
            return mid;
        } else if nums[mid as usize] < target {
            left = mid + 1;
        } else {
            right = mid - 1;
        }
    }
    -1
}

typescript

function search(nums: any, target: any): any {
    let left = 0;
    let right = nums.length - 1;
    
    while (left <= right) {
        const mid = Math.floor(left + (right - left) / 2);
        if (nums[mid] === target) {
            return mid;
        } else if (nums[mid] < target) {
            left = mid + 1;
        } else {
            right = mid - 1;
        }
    }
    return -1;
}

Comments (0)

Join the Discussion

Share your thoughts, ask questions, or help others with this problem.

Binary Search Target Index

Algorithm Flow

Best Answers

Solutions Coming Soon

Related Binary Search Problems

Festival Drone Altitude Limit

Lantern Stage Volume Check

Pier Ticket Window Time

Harbor Relay Coverage Radius

Marina Beacon Frequency Search

Minimal Climb Cost

Comments (0)

Join the Discussion