If a binary search always divides the sequence into 1%:99% subse

If a binary search always divides the sequence into 1%:99% subsequences, the binary search still take O(logN) time。 ~@[](5)

答案：TRUE