Tài liệu Thuật toán Algorithms (Phần 6) pptx
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 ... program:
46
CHAPTER 4
N 1 multiplications and N additions. The parenthesization
= x(x(x(x + 3) 6) + 2) + 1
makes the order of computation obvious:
for do y:=x*y+p[i];
This program (and t...
Tài liệu Thuật toán Algorithms (Phần 15) pptx
... by moving all the elements in at least one of them to a large
array. It is easy to translate the algorithms we have been examining to use
linked representations; in fact, sometimes there are other
Tài liệu Thuật toán Algorithms (Phần 17) pptx
... sorting and a good starting point for the implementation
of an external sort. The more sophisticated algorithms below could make the
sort run perhaps 50% faster, but not much more. (On the other hand, ... the internal methods that
we’ve
been studying).
There are two major factors which make external algorithms quite differ-
ent from those we’ve seen until now.
l’irst, the cost of access...
Tài liệu Thuật toán Algorithms (Phần 21) pptx
... hashing method.
Hashing is a “classical” computer science problem in the sense that the
various algorithms have been studied in some depth and are very widely used.
There is a great deal of empirical ... a logarithmic number of steps for all searches and insertions. This
is one of the few searching algorithms with that property, and its use is
justified whenever bad worst-case performance...
Tài liệu Thuật toán Algorithms (Phần 24) pptx
... disk
searching application.
Extendible Hashing
An alternative to B-trees which extends digital searching algorithms to apply
to external searching was developed in 1978 by R. Fagin, J. Nievergelt, N.
Pippenger, ... N NPRR STXX
As with external sorting, we must consider very small examples to under-
stand the algorithms but think about ve y large examples to appreciate their
performance. O...
Tài liệu Thuật toán Algorithms (Phần 26) pptx
... This makes the method convenient for use on a large file
being read in from some external device. (Algorithms which require backup
require some complicated buffering in this situation.)
Boyer-Moore
Tài liệu Thuật toán Algorithms (Phần 30) pptx
... part, the algorithms that we have studied have been de-
signed primarily to use as little time as possible and only secondarily to
conserve space.
In this section, we’ll examine some algorithms
Tài liệu Thuật toán Algorithms (Phần 34) pptx
... sentinel):
CHAPTER 25
Performance Issues
As mentioned in the previous chapter, geometric algorithms are somewhat
harder to analyze than algorithms from some of the other areas we’ve studied
because the input ... distribution is
extremely likely to be very close to the rectangle defining the distribution. The
algorithms that we’ve looked at depend on different properties of the point set...
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 1) doc
... useful
algorithms.
The book consists of forty chapters which are grouped into seven major
parts: mathematical algorithms, sorting, searching, string processing, geomet-
ric algorithms, graph algorithms ... structures and algorithms, ” on math-
ematical analysis for “design and analysis of algorithms, ” and on software
engineering techniques for “software tools”); in this book, the emp...