Back to Study Plan
Binary Search

Binary Search

In computer science, binary search, also known as half-interval search or logarithmic search, is a search algorithm that is commonly used to find the position of a target value within a sorted array. However, the binary search algorithm is not limited to arrays. In any scenario where one can determine if the target value is higher or lower than a given value, binary search can be used to repeatedly halve the search space for a target value.
Binary Search I
Binary Search I

Binary Search I

Avg. 1~2 problems / day 12 day

Easy
16
Medium
7
Hard
0
Binary Search II
Binary Search II

Binary Search II

Avg. 2 problems / day 20 day

Easy
0
Medium
39
Hard
1
Binary Search III
Binary Search III

Binary Search III

Avg. 2~3 problems / day 23 day

Easy
4
Medium
14
Hard
29