Hello coders, Today I have come up with the solution for another Leetcode problem ” **Binary Search Leet Code Solution** “.

But before jumping to the solution, Let’s take a look at the problem statement.

**Problem statement**:

Given an array of integers `nums`

which is sorted in ascending order, and an integer `target`

, write a function to search `target`

in `nums`

. If `target`

exists, then return its index. Otherwise, return `-1`

.

You must write an algorithm with `O(log n)`

runtime complexity.

**Example 1:**

Input:nums = [-1,0,3,5,9,12], target = 9Output:4Explanation:9 exists in nums and its index is 4

**Example 2:**

Input:nums = [-1,0,3,5,9,12], target = 2Output:-1Explanation:2 does not exist in nums so return -1

## Binary Search Leetcode Solution Java

//Binary Search Leetcode Solution in java class Solution { public int search(int[] nums, int target) { int low=0; int mid=0; int high=nums.length-1; while(low<=high){ mid=(low+high)/2; if(nums[mid]==target){ return mid; } else if(nums[mid]<target){ low=mid+1; } else if(nums[mid]>target){ high=mid-1; } else if(nums[mid] != target && low >= high){ return -1; } } return -1; } } //Binary Search Leetcode Solution in Java

**Disclaimer:** This problem(**Binary Search Leetcode solution**) is originally created by Leetcode. Codesagar only provides a solution for it. This solution is only for Educational and learning purposes.