binary search
📖 翻字典总是先翻正中间那一页
在有序数据中每次排除一半,100 万个数字最多只需查 20 次!
English
📖 Halving the search interval at every step
Search algorithm running in O(log N) time.
代码示例
int mid = low + (high - low) / 2;探索 100 张双语词卡 →
在有序数据中每次排除一半,100 万个数字最多只需查 20 次!
📖 Halving the search interval at every step
Search algorithm running in O(log N) time.
int mid = low + (high - low) / 2;探索 100 张双语词卡 →