Number Guessing

Binary Search

In this kind of games, we use binary search, The binary search consist in find 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 taking the middle element to compare to the target value, and repeating this until the target value is found. If the search ends with the remaining half being empty, the target is not in the array.

Well in this game we use the simple case of binary search like a game, because we are trying to guess one number and we only use binary search, so we apply some data structure, with algorithms and we have this great game.