raviranjan3570
/ BinarySearch.java
Last active
November 17, 2020 12:08
Algorithms for coding interview
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| class Solution { | |
| public int search(int[] nums, int target) { | |
| int left = 0; | |
| int right = nums.length - 1; | |
| while(left <= right){ | |
| int mid = left + (right - left) / 2; | |
| // if target is found | |
| if(nums[mid] == target){ | |
| return mid; |