数据结构习题答案13章.pptVIP

. The length of this subarray is at most n units wide, and we have done this initial bracketing in at most log n + 1 searches. A normal binary search of the subarray will find the position n in an additional log n searches at most, for a total cost in O(log n) searches. 下次课或者下下次课需要一位同学讲栈，一位同学讲线性表，这周之内报名，给我或者杨老师报名都可以。讲课有平时成绩可以加。 Thanks ! LOGO 数据结构与算法分析 任务： 1.讲解第一次作业：1.7 1.8 1.11 2.8 2.做题：2.9 2.10 2.12 3.第二次作业：3.1 3.3 3.5 3.10 然后讲解 2 和3 4.做题：3.4 3.16 3.17 3.18 讲解4 1.7 Every problem certainly does not have an algorithm. As discussed in Chapter 15（p482 15.3), there are a number of