Tài liệu Thuật toán Algorithms (Phần 50) ppt
Tài liệu Thuật toán Algorithms (Phần 50) ppt
...
37. Dynamic Programming
The principle of divide-and-conquer has guided the design of many of
the algorithms we’ve studied: to solve a large problem, break it up into
smaller problems which can ... applicable
(see Chapters 39 and as well as many “easy” problems for which it is
less efficient than standard algorithms. However, there is a certain class of
problems for which dynamic programmi...
Tài liệu Thuật toán Algorithms (Phần 56) ppt
... 227.
Matching, 443-452, 454.
match (general regular-expres-
sion pattern matching), 265.
Mathematical algorithms, 23-88.
Mathematical programming, 497.
Matrices.
addition, 28-29 (matradd).
band, 64.
chain ... recursive), 145.
Selection sort, 95 (selection), 144,
326.
Self-organizing search, 175.
Seminumerical algorithms, 88.
Sentinel, 106, 173, 273, 309, 329,
96, 247, 254, 493.
Separate cha...
Tài liệu Thuật toán Algorithms (Phần 5) ppt
... digits of the second term. This leads to the
following program:
3. Random Numbers
Our next set of algorithms will methods for using a computer to
generate random numbers. We will find many uses ... for simulation: to provide random or arbitrary inputs to programs.
Also, we will see examples of algorithms which gain efficiency by using random
numbers to do sampling or to aid in decision ma...
Tài liệu Thuật toán Algorithms (Phần 45) ppt
... complexity
of the analysis. Actually, this problem has been quite widely studied, and
complicated algorithms with much better worst-case time bounds have been
developed.
The network problem can ... the classical solution to the
network flow problem given below is closely related to the graph algorithms
that we have been examining. But this problem is one which is still actively
being stud...
Tài liệu Thuật toán Algorithms (Phần 46) ppt
... the
problem by considering some interesting special cases while at the same time
developing some useful algorithms.
Bipartite Graphs
The example mentioned above, matching medical students to residencies, ... subroutine
by a systems programmer. It is of fundamental importance in the theory
of advanced combinatorial algorithms (see Chapter 40). For the moment,
reduction will provide us with...
Tài liệu Thuật toán Algorithms (Phần 55) ppt
... Francisco, CA, 1979.
T. C. Hu, Combinatorial Algorithms, Addison-Wesley, Reading, MA, 1982.
H. R. Lewis and C. H. Papadimitriou, “The efficiency of algorithms, ” Scientific
American, 238, 1 (1978).
C. ... Steiglitz, Combinatorial Optimization: Algorithms
and Complexity, Prentice-Hall, Englewood Cliffs, NJ, 1982.
E. M. Reingold, J. Nievergelt, and N. Deo, Combinatorial Algorithms: Theory...
Tài liệu Thuật toán Algorithms (Phần 6) pptx
... interesting algorithms that we will
encounter are based on the divide-and-conquer technique of combining the
solutions of recursively solved smaller subproblems. The running time of such
algorithms ... more complicated problem is to evaluate a given polynomial at many
different points. Different algorithms are appropriate depending on how many
evaluations are to be done and whether or n...
Tài liệu Thuật toán Algorithms (Phần 12) ppt
... of efficiently implementing Quicksort than we have for other algorithms.
Similar implementation techniques are appropriate for other algorithms; with
Quicksort we can use them with confidence because ... explicit recursion.
This second approach is particularly appropriate for Quicksort and many
similar algorithms. We think of the stack as containing “work to be done,”
in the form of to be...
Tài liệu Thuật toán Algorithms (Phần 13) ppt
... These methods do not just
compare keys: they process and compare pieces of keys.
Radix sorting algorithms treat the keys as numbers represented in a
base-M number system, for different values