Tài liệu Thuật toán Algorithms (Phần 47) docx

... software capabilities certainly can have a significant impact on specific algorithms, but good algorithms on old machines are, for the most part, good algorithms on new machines. One reason for this is that the ... start with the algorithms that are best on conventional machines and adapt them to the particular features of the new machine. This approach encourages the persistence of ol...

Ngày tải lên: 15/12/2013, 02:16

... need to be studied in order to understand the algorithms. Simple algorithms can give rise to complicated data structures and, conversely, complicated algorithms can use simple data structures. When ... 9 INTRODUCTION 7 The study of algorithms is interesting because it is a new field (almost all of the algorithms we will study are less than twenty-five years old) with a rich traditi...

Ngày tải lên: 15/12/2013, 02:16

... performance of various algorithms, we can look forward to the development of general-purpose parallel computers that will provide improved performance for a wide variety of algorithms. 466 CHAPTER ... to learn the characteristics of a fundamental algorithm within the context of some of the other algorithms that we’ve been studying. In par- ticular, we’ll examine how to use the algorithm...

Ngày tải lên: 15/12/2013, 02:16

... something like or to be considered efficient. We’ve generally considered quadratic algorithms to be bad and cubic algorithms to be awful. But for the problems that we’ll consider in this and the ... graph. For all of the algorithms in those chapters, it was possible to arrange the computation so that each node is visited just once, and this leads to very efficient algorithms. For the H...

Ngày tải lên: 15/12/2013, 02:16

... queue operations (except join) can be done in logarithmic time using heaps. Algorithms on Heaps The priority queue algorithms on heaps all work by first making a simple structural modification ... condition is satisfied everywhere. Some of the algorithms travel through the heap from bottom to top, others from top to bottom. In all of the algorithms, we’ll assume that the records are on...

Ngày tải lên: 24/12/2013, 11:15

... 254 CHAPTER 19 Multiple Searches The algorithms that we’ve been discussing are all oriented towards a specific string searching problem: ... one of the keys will always be greater than the other.) Then the hashing, binary tree, and other algorithms of the previous section can be used directly. First, an entire structure is built up ... for particular patterns. There are many details which...

Ngày tải lên: 26/01/2014, 14:20

... connections with computer science and al- gorithms, especially the arithmetic and string-processing algorithms that we have studied. Indeed, the art (science?) of cryptology has an intimate relation- ship ... relation- ship with computers and computer science that is only beginning to be fully understood. Like algorithms, cryptosystems have been around far longer 295 CRYPTOLOGY by C=P(M)....

Ngày tải lên: 26/01/2014, 14:20

... 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...

Ngày tải lên: 15/12/2013, 02:16

... 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...

Ngày tải lên: 15/12/2013, 02:16

... the nearest integer is the number of bits required to represent N in binary. Implementing Algorithms The algorithms that we will discuss in this book are quite well understood, but for the most ... computer systems lose substantial time waiting for simple quadratic algorithms to finish when only slightly more complicated N log N algorithms are available which could run in a fraction t...

Ngày tải lên: 15/12/2013, 02:16