原书出处
Introduction to Algorithms, Fourth Edition
2 第2章 算法入门
of the subarray against v and eliminate half of the subarray from further consideration.
The binary search algorithm repeats this procedure, halving the size of the remaining portion of the subarray each time.
Write pseudocode, either iterative or recursive, for binary search. Argue that the worst-
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter002.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea