So this is probably a basic and slightly stupid question. So.....for a binary search to find a number it takes at most 2Log(n)+1 steps (or Log(2N) questions.
Im not a math major or anything, but simply a CS grad trying to remember back from college 5 years ago (Im trying to re-pick back up CS theory).
I guess I don't understand how we come to this? What I suppose "branch" of mathematics is this? I feel like although I passed my calc classes/ cs/math classes.....I prolly didn't retain much (due to rushing to get programming assignments done). Is this all discrete math where this is learned?