![](https://img-blog.csdnimg.cn/20201014180756926.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
算法导论
G0rgeoustray
Done is better than perfect.
展开
-
算法导论练习 3.1 Asymptotic notation
1 令 c1=12,c2=1c_1=\frac{1}{2},c_2=1c1=21,c2=1,因为 f(n),g(n)f(n),g(n)f(n),g(n) 均渐进非负,显然有 c1(f(n)+g(n))≤max(f(n),g(n))≤c2(f(n)+g(n)) c_1(f(n)+g(n))\leq max(f(n),g(n))\leq c_2(f(n)+g(n)) c1(f(n)+g(n))...原创 2020-04-13 23:00:07 · 296 阅读 · 0 评论 -
算法导论练习 2.3 Designing algorithms
1 {3, 9, 26, 38, 41, 49, 52, 57} {3, 26, 41, 52} {9, 38, 49, 57} {3, 41} {26, 52} {38, 57} {9, 49} {3} {41} {52} {26} {38} {57} {9} {49} 2 merge(A, p, q, r) m = q - q + 1 n = r - q let L[1..m] and R[...原创 2020-04-13 16:12:51 · 118 阅读 · 0 评论 -
算法导论练习 2.2 Analyzing algorithms
1 Θ(n3)\Theta(n^3)Θ(n3) 2 选择排序的伪码: for i = 1 to A.length - 1 min = i for j = i to A.length if A[j] < min min = j swap(a[i], a[min]) 最外层 for 的循环不变量:每次迭代开始时 AAA 的子数组 A[1…i−1]A[1\dots i-1]A[...原创 2020-04-13 13:49:45 · 121 阅读 · 0 评论 -
算法导论练习 2.1 Insertion sort
{31, 41, 59, 26, 41, 58} {31, 41, 59, 26, 41, 58} {31, 41, 59, 26, 41, 58} {26, 31, 41, 59, 41, 58} {26, 31, 41, 41, 59, 58} {26, 31, 41, 41, 58, 59} for j = 2 to A.length key = A[j] i = j - 1 ...原创 2020-04-13 13:01:46 · 118 阅读 · 0 评论 -
算法导论练习 1.2 Algorithms as a technology
网页广告投放; 即求不等式的正整数解: 8n2<64n lg n2≤n≤43 8n^2<64n\ lg\ n\\2\le n\le43 8n2<64n lg n2≤n≤43 根据以下的 C++ 代码,答案为 15 #include <iostream> #include <cmath> using namespa...原创 2020-04-12 22:55:21 · 102 阅读 · 0 评论 -
算法导论练习 1.1 Algorithms
Sorting: Search engines need to sort the searching results. Computing a convex hull: computing the minimum diameters of a set of points on a plane. Coding efficiency, reading efficiency. Array. Stren...原创 2020-04-12 18:37:35 · 105 阅读 · 0 评论