Binary search complexity

Question

In sorted array of numbers binary search gives us comlexity of O(logN). How will the complexity change if we split array into 3 parts instead of 2 during search?

Answer 1

Same. You will get a running time only differing by constant factor ($\log_2 3=\frac{\ln 3}{\ln 2}$).