摘要：
Undirected Graphs （无向图） G = (V, E) V = nodes. E = edges between pairs of nodes. Captures pairwise relationship between objects. （捕获对象之间的成对关系） Graph si 阅读全文
posted @ 2020-11-14 23:49
Jasper2003
阅读(164)
评论(0)
推荐(0)
摘要：
Question 1: Solution: Question 2: Solution: Question 3: Solution: Other questons: <1> Chapter 2: 3, 4, 8 <2> Chapter 2: Sections 2.1, 2.2, 2.4 阅读全文
posted @ 2020-11-14 09:43
Jasper2003
阅读(119)
评论(0)
推荐(0)
摘要：
Linear Time: O(n) Linear time. Running time is proportional to input size. （线性时间: 运行时间与输入大小成正比） <1>Computing the maximum. Compute maximum of n numbers 阅读全文
posted @ 2020-11-14 08:58
Jasper2003
阅读(231)
评论(0)
推荐(0)
摘要：
1. Asymptotic Order of Growth Upper bounds. T(n) is O(f(n)) if there exist constants c > 0 and n0 ≥ 0 such that for all n ≥ n0 we have T(n) ≤c · f(n). 阅读全文
posted @ 2020-11-14 07:37
Jasper2003
阅读(389)
评论(0)
推荐(0)
摘要：
1. 简介 在计算理论中；有一种理论称作‘计算复杂性理论’（computational complexity theory ）,专门研究计算问题时所需的资源，比如时间和空间，以及如何尽可能地节省这些资源。 2. Polynomial-Time Brute force. For many non-tr 阅读全文
posted @ 2020-11-14 07:04
Jasper2003
阅读(673)
评论(0)
推荐(0)
浙公网安备 33010602011771号