So if you think about the way something like, say, Mapquest works, and last week in recitation you looked at the fact that shortest path is exponential.
所以如果你想想电子地图,还有上周学的列举法,你就会发现一般最简单的方法,都是指数递增的。
Let's pull together what this algorithm actually does. If I generalize binary search, here's what I'm going to stake that this thing does.
总结下二分查找法,下面列举几点它的操作,首先,找中点。
应用推荐