Array (  =>  => questions  => Popular-Algorithms  => Binary-Search )
Given a list of integers and a search value. Find the search value from the array using Binary Search Algorithm.
First line contains the size of array (n), Second line contains the search value followed by n integers separated by spaces.
Print the index of the search value if present else print -1 .
5 3 1 2 3 4 5
6 28 34 46 33 25 67 45
6 280 304 496 353 235 675 280
Step-i) Take the input search value and array from the user.
Step-ii) Find the middle element of the array, If the middle element equals to the search value return the index of element.
Step-iii) Else If check whether the search value is less than or greater than the middle element.
Step-iv) If less than the middle value repeat steps (ii) and (iii) for left subarray, else greater than the middle value repeat steps (ii) and (iii) for right subarray.
Step-v) If the element doesn’t match in any process return -1 and terminate.
Time Complexity: O(log(n))
Space Complexity: O(1)
Let us know if you can come up with a better approach, mail us at email@example.com Your approach will be reviewed and posted with credits to you.