A balanced binary search divides the sequence into 50%:50% equal

A balanced binary search divides the sequence into 50%:50% equal sized subsequences. Now we define the unbalanced binary search to be always dividing the sequence into 1%:99% subsequences. That is, we always test at the position corresponding to the fraction 1/100 of the input of size N (e.g., if N=1000, we will test the position 10 of the array). So the binary search still take O(logN) time. ~@[](5)

答案：TRUE