Leetcode Problem 704. Binary Search

704. Binary Search

Leetcode Solutions

Initialize two pointers left at 0 and right at nums.length - 1.
While left is less than or equal to right: a. Calculate the middle index mid as (left + right) / 2. b. If nums[mid] is equal to target, return mid. c. If nums[mid] is less than target, move the left pointer to mid + 1. d. Else, move the right pointer to mid - 1.
If the target is not found, return -1.

Programming Language

Purpose:

General Question

Debug My Code

image/screenshot of info(optional)

Full Screen