-
-
-
《算法导论》原版英文课件3
Lecture 3 Divide-and-Conquer Strassen, Fibonacci, Polynomial Multiplication.pdf
-
合并排序源码
合并排序是建立在归并操作上的一种有效的排序算法。该算法是采用分治法(Divide and Conquer)的一个非常典型的应用
-
Introduction to Algorithms, Second Edition
... Emde Boas trees and multithreaded algorithms, and substantial additions to the chapter on recurrences (now called "Divide-and-Conquer"). It features improved treatment of dynamic programming and greedy algorithms and a new notion of edge-based ...
-
-
算法导论(英文第三版)
... Emde Boas trees and multithreaded algorithms, substantial additions to the chapter on recurrence (now called "Divide-and-Conquer"), and an appendix on matrices. It features improved treatment of dynamic programming and greedy algorithms and a ...
-
算法导论第三版
... Emde Boas trees and multithreaded algorithms, and substantial additions to the chapter on recurrences (now called "Divide-and-Conquer"). It features improved treatment of dynamic programming and greedy algorithms and a new notion of edge-based ...
-
算法导论第三版
... 16), and amortized analysis (Chapter 17). Earlier parts have presented other
widely applicable techniques, such as divide-and-conquer, randomization, and how
to solve recurrences. The techniques in this part are somewhat more sophisticated,
but they help ...
-
英文原版Algorithm
1. Algorithms with numbers
2. Divede-and-conquer algorithms
3. Decompositions of graphs
4. Pahths in graphs
5. Greedy algorithms
6. Dynamic programming
7. Linear programming and reductions
8. NP-complete problems
9. Coping with NP-completeness
10. Quantum ...
-
[算法导论第三版] Introduction to algorithm 3rd edition
... Emde Boas trees and multithreaded algorithms, substantial additions to the chapter on recurrence (now called "Divide-and-Conquer"), and an appendix on matrices. It features improved treatment of dynamic programming and greedy algorithms and a ...
-