《算法導論(第4版)》學習第 20 天，p91-p94 總結，總計 4 頁。

一、技術總結

1. recursion tree

In graph theory, a recursive tree (i.e., unordered tree) is a labeled, rooted tree. A size-n recursive tree's vertices are labeled by distinct positive integers 1, 2, …, n, where the labels are strictly increasing starting at the root labeled 1.

二、英語總結(生詞：1)

1. ground

(1)ground

vt. to establish the base(foundation) of something/base something on something(為......建立基礎，奠定......的基礎),

(2)示例

You ground the induction on a range of values from a convenient positive constant n? up to some constant n?′ > n? such that for n ≤ n? the recurrence always bottoms out in a constant-sized base case between n? and n?′(《《算法導論(第4版)》》第 91 頁)。

關于英語的注解同步更新匯總到 https://github.com/codists/English-In-CS-Books 倉庫。

三、其它

這樣太慢了，不得行，得加快進度。

四、參考資料

1. 編程

(1) Thomas H. Cormen，Charles E. Leiserson，Ronald L. Rivest，Clifford Stein，https://book.douban.com/subject/35591269/

2. 英語

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

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

歡迎搜索及關注：編程人(a_codists)