《Programming Abstractions in C》学习第 66 天，p235-p241 总结。

一、技术总结

1.backtracking algorithm(回溯算法)

(1)定义

p236, For many real-world problem, the solution process consits of working your way

through a sequence of decision points in which each choic leads you further along

some path. If you make the correct set of choices, you end up at the solution. On the

other hand, if reach a dead end or otherwise discover you have made an

incorrect choice somewhere along the way, you have to backtrack to a precious

decision point and try a different path. Algorithm that use this approach are called

backtracking algorithm.

根据书中的定义，应用了“这种方法(approach)”的算法称为回溯算法。那么，“这种方法(approach)”是什么样的方法呢？这种方法是：发现当前决策错误的时候，回溯到之前的某个决策点(a previous decision point)，选择其它路径(try a different path)。

问题：a previsou decision point 是指之前的某一个决策点，还是上一个决策点。

二、英语总结

1.decision point 用法

答：意思是“决策点”。p236, For many real-world problem, the solution process consits of working your way through a sequence of decision points in which each choic leads you further along some path。

2.be home free 是什么意思？

答：to be certain to succeed at sth because you have done the most difficult part of it(胜券在握)。

3.vantage point 是什么意思？

答：a state, position, or opportunity affording superiority or advantage，优势。vantage 多用于与 sight(视野)相关的场景。“vantage point”: a place, especially a high place, that provides a good, clear view of an area(有利地位)。

三、参考资料

1. 编程

(1)Eric S.Roberts，《Programming Abstractions in C》：https://book.douban.com/subject/2003414

2. 英语

(1)Etymology Dictionary：https://www.etymonline.com

(2) Cambridage Dictionary：https://dictionary.cambridge.org

欢迎搜索及关注：编程人(a_codists)