Binary Search

Binary Search:
This is our Online Judge Demo. Please try it out.
In computer science, binary search is a search algorithm that finds the position of a target value within a sorted array.
Binary search compares the target value to the middle element of the array. If they are not equal, the half in which the target cannot lie is eliminated and the search continues on the remaining half. Again take the middle element to compare with the target value, and repeat this until the target value is found. If the search ends with the remaining half being empty, the target is not in the array.

Example:
Input:
arr = [1, 2, 4], target = 2
Output:
1
Explanation:
Return the index of the target value.

Example:
Input:
arr = [1, 2, 4], target = 0
Output:
-1
Explanation:
Return -1 if the target value not exist in the array.

Solve the problem:
Python3
def binary_search(array, target):





Get one-to-one training from Google Facebook engineers

Top-notch Professionals

Learn from Facebook and Google senior engineers interviewed 100+ candidates.
Most recent interview questions and system design topics gathered from aonecode alumnus.
One-to-one online classes. Get feedbacks from real interviewers.

Customized Private Class

Already a coding expert? - Advance straight to hard interview topics of your interest.
New to the ground? - Develop basic coding skills with your own designated mentor.
Days before interview? - Focus on most important problems in target company question bank.