vt. amortize originally means "to kill off", overtime, it evolves to mean "to pay off gradually by periodic payments of principal and interest(分期偿还，摊销)"。

2025年5月编程人总共更新了30篇文章：1.2025年4月文章一览2.《算法导论(第4版)》阅读笔记：p2-p33.《算法导论(第4版)》阅读笔记：p4-p54.《算法导论(第4版)》阅读笔记：p6-p65.《算法导论(第4版)》阅读笔记：p7-p86.《算法导论(第4版)》阅读笔记：p9-p9(被系统吃了，...

《算法导论(第4版)》学习第 30 天，p173-p174 总结，总计 2 页。一、技术总结无。二、英语总结(生词：1)1. embellishment(1)embellish: em-("in") + bel("beautiful")vt. to make sth more beautiful by adding something to it(“装饰”)。(2)embellishmentc/u. the a...

《算法导论(第4版)》学习第 29 天，p164-p172 总结，总计 9 页。一、技术总结1. heap(1)(binary) heap(堆/二叉堆)(2)complete binary tree(完全二叉树)(3)max-heapA[PARENT(i)] ≥ A[i]。(4)min-heapA[PARENT(i)] ≤ A[i]。(5)应用priority queue(优先队列)。2. priori...

《算法导论(第4版)》学习第 28 天，p162-p163 总结，总计 2 页。一、技术总结1. heap sort(1) (binary) heap(堆/二叉堆)(2)complete binary tree(完全二叉树)(3)max-heap(最大堆)定义：A[PARENT(i)] ≥ A[i]。看了很多定义，不得不说还是这个定义最简洁，准确。(4)min...

《算法导论(第4版)》学习第 27 天，p156-p161 总结，总计 6 页。一、技术总结1. heap sort(1)(binary) heap(堆/二叉堆)(2)complete binary tree(完全二叉树)真是非常不喜欢“树”这种数据结构，各种概念能把人绕晕，例如：树 > 二叉树 > 完全二叉树。二、英语总...

《算法导论(第4版)》学习第 26 天，p134-p155 总结，总计 22 页。一、技术总结无。二、英语总结(生词：1)1. paradox(1)paradox: para-("contrary to") + doxa("opinion")c/u. a situation that contains two opposite facts(悖论)。(2)示例"This statement is false....

附录 C 介绍了计数理论(如：和规则，积规则，串，排列，组合，二项式系数，二项式界等)，概率理论(如：样本空间，事件，概率论公理，离散概率分布，连续均匀概率分布，贝叶斯定理等)，几何分布与二项分布，二项分布的尾部探究。第 5 章会时不时的涉及这些内容，还是...

Probabilistic analysis is the use of probability in the analysis of problems.

c. originally, vagary means physical wandering, over time, it evolves to describe unpredictable changes(变幻莫测)。

compass literally means "to step together", reflecting the idea of encircling(包围)。c.

vt. to understand something immediately based on your feeling rather than facts(凭直觉知道)。

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.

c. a hint(提示)；a slight knowledge(一点点知识，浅薄的认知，强调程度轻微，有限。翻译的时候转成动词翻译较好)。

If we wish to refer to matrices without specifically writing out all their entries, we will use uppercase A, B, C, and so on. In general, aᵢⱼ will denote the entry of the matrix A that is in the ith row and the jth column. We will refer to this en...

因为第 4 章涉及到矩阵，矩阵属于线性代数(linear algebra)范畴，如果不熟悉，可以看一下作者推荐的两本教材：Gilbert Strang的《Introduction to Applied Mathematics》和《Linear Algebra and Its Applications》。个人补充一本Steven J. Leon, Lisette G. de Pill...

Generally, we’ll assume that the matrices are dense, meaning that most of the n² entries are not 0, as opposed to sparse, where most of the n² entries are 0 and the nonzero entries can be stored more compactly than in an n × n array.

For any real number x, we denote the greatest integer less than or equal to x by ⌊x⌋ (read 'the floor of x') and the least integer greater than or equal to x by ⌈x⌉ (read 'the ceiling of x'). The floor function is monotonically increasing, as is t...

《算法导论(第4版)》学习第 14 天，p49-p58 总结，总计 10 页。一、技术总结1. O-notation, Ω-notation, and ‚Θ-notation(1)O-notationO-notation describes an asymptotic upper bound. (2)Ω-notationΩ-notation describes an asymptotic lower bound. (3)Θ-notatio...

《算法导论(第4版)》学习第 13 天，p39-p48 总结，总计 10 页。一、技术总结1. recurrence/recurrence equation书里面 recurrence(递归式) 和 recurrence equation(递归方程) 指的是同一个东西。二、英语总结(生词：2)1. squint(1)squintvi. look askance(斜视)；loo...