Algorithm design and Analysis Foundation (3rd edition)
- P16 In-place translated for ' reign '? ' in place ' more appropriate point
- P38 amortized should be translated as ' averaging ', the word ' amortization ' is simply baffling (perhaps because the translation is done by algorithmic trading?). ）
- P64 iterations are better than recursion (iterations are always incremental, and recursion is not incremental, unless you can dump the entire run-time stack)
- P73 a better non-recursive algorithm (human image cognitive intuition thinking) through algorithm visualization? ）
- P79 Verify if a topology is a ring, star, or regiment? (This place is kind of interesting, because I think of the dynamic verify)
- p87 convex hull problem: from the data structure,set<linesegment>--and sortedlist<point>
- P92 Hungarian method for solving distribution problems (Konig & egervary)? Damn, it's not in the book.
- p97 (no direction diagram?) DFS corresponds to tree edges and back edges, while bfs corresponds to tree edges and fork edges.
- p112 generation Arrangement: Johnson-throttler algorithm (the greatest advantage of the book is that the algorithm has a person's name, ha)
- p115 Exercise 4 Heappermute
- This pseudo-code algorithm is a bit difficult to understand, I remember the standard writing does not seem to write it?
- p119 ' every second ' is translated as "second at a Time", which seems to translate "even numbered" to a more appropriate point
- p122 Lomuto Division: This seems to be Steven S.skiena's "Algorithm Design Manual (2nd edition)" In the quick sort of the version used, in fact, a little bit of skill
- P124 a more sophisticated algorithm for selecting pivot in a fast sort and maintaining linear time efficiency in the worst case scenario???
- p127 Nim game: There are typographical errors here, should be "just add to 100"
- p132 main theorem: The form of this theorem is not correct, should go to see Sara Basse "Computer Algorithm" (This book 2001 years, How never updated?) ）
- p137 Quick Sort (hoarepartition): Because both sides of the scan encountered = = Situation will stop, this is equivalent to A[i]==a[j]
- p138 when i>=j to cancel the last swap? By
- P140 ' World's leading expert ' translates into ' authority ', by
- The hardest thing about the p147 Strassen algorithm is to remember the formula for multiplying the 7 sub-matrices.
- p149 recently: Get D recursively (actually interesting here), then deal with boundary conditions according to D division
- Processing boundaries: Local constraints on data reduce the size of the problem
- p151 Convex bag/quick bag: Here straight to the left/right side of the argument is very confusing
- p155 reduction I like to be translated as ' Covenant ' instead of ' simplifying '
- p159 problem 10: Note that the point set for the result here is 22 non-comparable (x1>x2 but y1<y2)
- p162 Partial Select Principal: Avoids the error caused by the subtraction of large numbers (this error is also used as a divisor, causing the error to be amplified)
- p166 Note that in the full expansion of the determinant, the sign of each item depends on the sum of the difference in the value of the row and column
- The p171 AVL tree speaks very well in the book Data Structure and algorithm analysis of Mark Allen Weiss.
- p174 2-3 trees: How can I not understand that 2-3 trees are always highly balanced? There seem to be 2 kinds of inner nodes ...
- p190 linear Programming/simplicity: only a conceptual description
- p195 integer Linear Programming (ILP) is NPC?
- p201 Horspool is a simplified version of BM (why doesn't this book talk about KMP? But BM is really a bit more complicated than KMP.
- P204 This book to explain Boyer-moore more detailed, worth a closer look (KMP considered the pattern inside the repetition, but it is the prefix match; but BM considers the size of the alphabet)
- P220 Dynamic Planning: DP's classic example is "Edit distance"
- P226 in order to design a dynamic programming algorithm, we need to derive a recursive relation
- p230 optimal BST: a bit complicated ...
- p243 Greed: Each step of the choice must meet 3 conditions: feasible, local optimal, non-cancellation (? ）
- p248 Prim algorithm correctness proves that good
- p259 Fibonacci Heap Implementation Priority queue: ' only has theoretical value '?
- p263 Dynamic Huffman tree? Interesting
- p266 iterative improvements? Fast Iteration + Incremental Improvements
- p270 simplex: When the pole is not the optimal solution, it deals with the next neighbor (which seems to use state space retrieval techniques such as some random gradient descent)
- The incremental process of p275 simplex may be unstable
- p276 ellipsoid Method/karmarkar Algorithm (interior point method?) ）
- p279 Maximum flow: Remember 2 nouns, augmented path and pre-flow propulsion, ha
- p285 pre-flow propulsion is not an iterative improvement because it does not generate a series of asymptotically optimal solutions without satisfying constraints
- p286 more advanced maximum flow: Dinitz, Karzanov, Malhotra-kamar-maheshwari, Goldberg-tarjan
- Me: Why not go straight to reading the math monograph on network optimization?-_-
- p291 boost Efficiency: Multiple iterations are completed in one phase (Batch? ）
- p291 weighted binary graph Max match: This should be a very complicated algorithm, by
- p293 stable marriage: Reminds me of ' electoral geometry '
- p308 difficult to solve (untractable) and non-judgment
- Can it be ' partially computable ' and ' partially determined '?
- Proof of downtime: This form proves to be not intuitive, if the discrete ' All programs ' space is actually ' non-enumerable '?
- p319 ill-conditioned Problem: The ordinary differential equation corresponding to non-rigid (Non=stiff)?
- p320 example of a two-dimensional equation, interesting
- P332 Branch Gauge: It looks a little hard to understand.
- p344 tsp approximate algorithm: the famous christofides? More complex than ' 2 weeks ' around the tree
- For Euclid instances, local find inspiration: 2, 3, Lin-kernighan
- p364 I remember an example of a kind of ' Super linear acceleration ' in parallel algorithms?
Basic algorithm design and Analysis (3rd edition) reading notes (and several translation errors ~ ~)
