Tài liệu Thuật toán Algorithms (Phần 24) pptx
Tài liệu Thuật toán Algorithms (Phần 24) pptx
... of
instructions executed when a Patricia tree is built from N random keys.
18. External Searching
Searching algorithms appropriate for accessing items from very large
files are of immense practical impcrtance. ... are expected to
return a large number of records. In later chapters we’ll see some examples
of algorithms which are appropriate for some search requests of this type,
but genera...
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 ... out that this holds true (roughly) for all N, and we have the solution
M(N)
We’ll see several algorithms from different applications areas whose perfor-
mance characteristics are describ...
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
... 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 accessing an item
is ... for external sorting, the
“s:istems”
aspect of the problem is cer-
tainly as important as the algorithms
.ispect.
Both areas must be carefully
considered if an effective external sort...
Tài liệu Thuật toán Algorithms (Phần 21) pptx
... rotation operation is defined on any
binary search tree and is the basis for several balanced tree algorithms. It is
important to note, however, that doing a single rotation doesn’t necessarily
improve ... 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 performanc...
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
... of
“two-dimensional sort” because frequent parallels to sorting algorithms arise
in the study of algorithms for finding the convex hull.
In fact, the algorithms that we’ll study show that finding the convex ... do. For all of the algorithms that we
consider, it is convenient to do the computation in place: the array used for
the original point set is also used to hold the output. The...
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 ... . .
Algorithms, Outline of Topics
1. Preview. . . . . . . . . . . . . . . . . . . . . . .
Pascal, Euclid’s Algorithm, Recursion, Analysis of Algorithms
Implementing Algorithms
MA...
Từ khóa: