Basic algorithm design and Analysis (3rd edition) reading notes (and several translation errors ~ ~)

Source: Internet
Author: User

Algorithm design and Analysis Foundation (3rd edition)
  1. P16 In-place translated for ' reign '? ' in place ' more appropriate point
  2. P38 amortized should be translated as ' averaging ', the word ' amortization ' is simply baffling (perhaps because the translation is done by algorithmic trading?). )
  3. P64 iterations are better than recursion (iterations are always incremental, and recursion is not incremental, unless you can dump the entire run-time stack)
  4. P73 a better non-recursive algorithm (human image cognitive intuition thinking) through algorithm visualization? )
  5. P79 Verify if a topology is a ring, star, or regiment? (This place is kind of interesting, because I think of the dynamic verify)
  6. p87 convex hull problem: from the data structure,set<linesegment>--and sortedlist<point>
  7. P92 Hungarian method for solving distribution problems (Konig & egervary)? Damn, it's not in the book.
  8. p97 (no direction diagram?) DFS corresponds to tree edges and back edges, while bfs corresponds to tree edges and fork edges.
  9. p112 generation Arrangement: Johnson-throttler algorithm (the greatest advantage of the book is that the algorithm has a person's name, ha)
  10. p115 Exercise 4 Heappermute
    1. This pseudo-code algorithm is a bit difficult to understand, I remember the standard writing does not seem to write it?
  11. p119 ' every second ' is translated as "second at a Time", which seems to translate "even numbered" to a more appropriate point
  12. 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
  13. P124 a more sophisticated algorithm for selecting pivot in a fast sort and maintaining linear time efficiency in the worst case scenario???
  14. p127 Nim game: There are typographical errors here, should be "just add to 100"
  15. 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?) )
  16. p137 Quick Sort (hoarepartition): Because both sides of the scan encountered = = Situation will stop, this is equivalent to A[i]==a[j]
    1. p138 when i>=j to cancel the last swap? By
  17. P140 ' World's leading expert ' translates into ' authority ', by
  18. The hardest thing about the p147 Strassen algorithm is to remember the formula for multiplying the 7 sub-matrices.
  19. p149 recently: Get D recursively (actually interesting here), then deal with boundary conditions according to D division
    1. Processing boundaries: Local constraints on data reduce the size of the problem
  20. p151 Convex bag/quick bag: Here straight to the left/right side of the argument is very confusing
  21. p155 reduction I like to be translated as ' Covenant ' instead of ' simplifying '
  22. p159 problem 10: Note that the point set for the result here is 22 non-comparable (x1>x2 but y1<y2)
  23. 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)
  24. 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
  25. The p171 AVL tree speaks very well in the book Data Structure and algorithm analysis of Mark Allen Weiss.
  26. 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 ...
  27. p190 linear Programming/simplicity: only a conceptual description
    1. p195 integer Linear Programming (ILP) is NPC?
  28. 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.
  29. 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)
  30. P220 Dynamic Planning: DP's classic example is "Edit distance"
  31. P226 in order to design a dynamic programming algorithm, we need to derive a recursive relation
  32. p230 optimal BST: a bit complicated ...
  33. p243 Greed: Each step of the choice must meet 3 conditions: feasible, local optimal, non-cancellation (? )
  34. p248 Prim algorithm correctness proves that good
  35. p259 Fibonacci Heap Implementation Priority queue: ' only has theoretical value '?
  36. p263 Dynamic Huffman tree? Interesting
  37. p266 iterative improvements? Fast Iteration + Incremental Improvements
  38. 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)
    1. The incremental process of p275 simplex may be unstable
    2. p276 ellipsoid Method/karmarkar Algorithm (interior point method?) )
  39. p279 Maximum flow: Remember 2 nouns, augmented path and pre-flow propulsion, ha
    1. p285 pre-flow propulsion is not an iterative improvement because it does not generate a series of asymptotically optimal solutions without satisfying constraints
  40. p286 more advanced maximum flow: Dinitz, Karzanov, Malhotra-kamar-maheshwari, Goldberg-tarjan
    1. Me: Why not go straight to reading the math monograph on network optimization?-_-
  41. p291 boost Efficiency: Multiple iterations are completed in one phase (Batch? )
  42. p291 weighted binary graph Max match: This should be a very complicated algorithm, by
  43. p293 stable marriage: Reminds me of ' electoral geometry '
  44. p308 difficult to solve (untractable) and non-judgment
    1. Can it be ' partially computable ' and ' partially determined '?
    2. Proof of downtime: This form proves to be not intuitive, if the discrete ' All programs ' space is actually ' non-enumerable '?
  45. p319 ill-conditioned Problem: The ordinary differential equation corresponding to non-rigid (Non=stiff)?
    1. p320 example of a two-dimensional equation, interesting
  46. P332 Branch Gauge: It looks a little hard to understand.
  47. p344 tsp approximate algorithm: the famous christofides? More complex than ' 2 weeks ' around the tree
    1. For Euclid instances, local find inspiration: 2, 3, Lin-kernighan
  48. 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 ~ ~)

Contact Us

The content source of this page is from Internet, which doesn't represent Alibaba Cloud's opinion; products and services mentioned on that page don't have any relationship with Alibaba Cloud. If the content of the page makes you feel confusing, please write us an email, we will handle the problem within 5 days after receiving your email.

If you find any instances of plagiarism from the community, please send an email to: info-contact@alibabacloud.com and provide relevant evidence. A staff member will contact you within 5 working days.

A Free Trial That Lets You Build Big!

Start building with 50+ products and up to 12 months usage for Elastic Compute Service

  • Sales Support

    1 on 1 presale consultation

  • After-Sales Support

    24/7 Technical Support 6 Free Tickets per Quarter Faster Response

  • Alibaba Cloud offers highly flexible support services tailored to meet your exact needs.