Tài liệu Thuật toán Algorithms (Phần 22) pdf
Tài liệu Thuật toán Algorithms (Phần 3) pdf
... doubles, the running time increases
eightfold.
Few algorithms with exponential running time are likely to be ap-
propriate for practical use, though such algorithms arise naturally as
“brute-force” ... effect of the leading term dominates; for small
N or for carefully engineered algorithms, more terms may contribute and
of algorithms are more difficult. In most cases, we’ll simply ref...
Tài liệu Thuật toán Algorithms (Phần 4) pdf
... some simple
algorithms for addition and multiplication of polynomials and matrices. The
algorithms themselves are well-known and straightforward; we’ll be examining
sophisticated algorithms for ... numbers to be of type integer or with all of the normal arithmetic
operations defined on both types. Algorithms come into play when the opera-
tions must be performed on more complicated ma...
Tài liệu Thuật toán Algorithms (Phần 8) pdf
... all fall very
close to the diagonal. In such cases, the inner loops of the Gaussian elimination
algorithms need only be iterated a few times, so that the total running time
(and storage requirement) ... equations has been shown to be computationally
equivalent to multiplying matrices, so tlhere exist algorithms (for example,
Strassen’s matrix multiplication algorithm) which can solve syst...
Tài liệu Thuật toán Algorithms (Phần 10) pdf
... of the Game
Before considering some specific algorithms, it will be useful to discuss some
general terminology and basic assumptions for sorting algorithms. We’ll be
considering methods of sorting ... 13, but most of the algorithms
that we’ll consider are internal sorts.
As usual, the main performance parameter that we’ll be interested in is
the running time of our sorting algorithms. As...
Tài liệu Thuật toán Algorithms (Phần 16) pdf
... (together with Quicksort) are typical of im-
plementations of divide-and-conquer algorithms. We’ll see several algorithms
with similar structure in later chapters, so it’s worthwhile to take a ... recursion comes into play.
Many algorithms are quite simply expressed in a recursive formulation.
In modern programming environments, recursive programs implementing such
algorithms can be qu...
Tài liệu Thuật toán Algorithms (Phần 19) pdf
... the programs to handle more complicated records and keys, but
this won’t fundamentally change the algorithms. For example, info could be
made into a pointer to an arbitrarily complicated record ... or largest key value to simplify
174
CHAF’TER 14
the coding of the inner loop of various sorting algorithms.
This method takes about N steps for an unsuccessful search (every record
must be exam...
Tài liệu Thuật toán Algorithms (Phần 20) pdf
... memory for the links, while Quicksort sorts with only a little extra
memory.
The running times of algorithms on binary search trees are quite depen-
dent on the shapes of the trees. In the best ... However,
binary trees also provide a good example of a recurrent theme in the study
of searching algorithms: the delete function is often quite cumbersome to
implement. To delete a node from a ....
Tài liệu Thuật toán Algorithms (Phần 23) pdf
... ‘Andrews’, but after
‘Aitken”‘) followed by sequential search (“ ‘Algonquin’ . . . ‘Algren’ . . . No,
Algorithms isn’t listed!“). Of course computers are likely to be somewhat
better than humans at
Tài liệu Thuật toán Algorithms (Phần 25) pdf
... problem can be characterized as a searching prob-
lem with the pattern as the key, but the searching algorithms that we have
studied do not apply directly because the pattern can be long and because
it ... unknown way. It is an interesting problem
to study because several very different (and surprising) algorithms have only
recently been discovered which not only provide a spectrum of use...