Background Projects

I developed an understanding of binary searches by creating this code. This is the most efficient way to determine a random number out of a range of numbers. Instead of going one by one and seeing if each nymber is the number the player is thinking of, it splits the range of numbers in half every time until it knows the number. this is going from O(N) to O(log_2(N)).