算法I~IV（C++实现）——基础、数据结构、排序和搜索（第三版 英文影印版）

　　 THIS BOOK IS intended to survey the most important computer algorithms in use today, and to teach fundamental techniques to the growing number of people in need of knowing them. It can be used as a textbook for a second, third, or fourth course in computer science, after students have acquired basic programming skills and familiarity with computer systems, but before they have taken specialized courses in advanced areas of computer science or computer applications. The book also may be useful for self study or as a reference for people engaged in the development of computer systems or applications programs, since it contains implementations of useful algorithms and detailed information on these algorithms' performance characteristics. The broad perspective taken makes the book an appropriate introduction to the field.
　　

fundamentals
chapter 1. introduction 3
1.l algorithms' 4
l.2 a sample problem-connectivity' 7
1.3 union-find algorithms' 11
1.4 perspective' 22
1.5 summary of topics' 24

chapter 2. principles of algorithm analysis 27
2.1 implementation and empirical analysis' 28
2.2 analysis of algorithms' 33
2.3 growth of functions' 36
2.4 big-oh notation' 44
2.5 basic recurrences' 49
2.6 examples of algorithm analysis' 53
2.7 guarantees, predictions, and limitations' 59
data structures

chapter 3. elementary data structures 69
3.1 building blocks' 70

　　 THIS BOOK IS intended to survey the most important computer algorithms in use today, and to teach fundamental techniques to the growing number of people in need of knowing them. It can be used as a textbook for a second, third, or fourth course in computer science, after students have acquired basic programming skills and familiarity with computer systems, but before they have taken specialized courses in advanced areas of computer science or computer applications. The book also may be useful for self study or as a reference for people engaged in the development of computer systems or applications programs, since it contains implementations of useful algorithms and detailed information on these algorithms' performance character istics. The broad perspective taken makes the book an appropriate introduction to the field.
　　 I have completely rewritten the text for this new edition, and I have added more than a thousand new exercises, more than a hundred new figures, and dozens of new programs. I have also added detailed commentary on all the figures and programs. This new material provides both coverage of new topics and fuller explanations of many of the classic algorithms. A new emphasis on abstract data types throughout the book makes the programs more broadly useful and relevant in modern programming environments. People who have read old editions of the book will find a wealth of new information throughout; all readers will find a wealth of pedagogical material that provides effective access to essential concepts.
　　 Due to the large amount of new material, we have split the new edition into two volumes (each about the size of the old edition) of which this is the first. This volume covers fundamental concepts, data structures, sorting algorithms, and searching algorithms; the second volume covers advanced algorithms and applications, building on the basic abstractions and methods developed here. Nearly all the material on fundamentals and data structures in this edition is new.
　　 This book is not just for programmers and computerscience students. Nearly everyone who uses a computer wants it to run faster or to solve larger problems. The algorithms in this book represent a body of knowledge developed over the last 50 years that has become indispensible in the efficient use of the computer, for a broad variety of applications. From N-body simulation problems in physics to genetic-sequencing problems in molecular biology the basic methods described here have become essential in scientific research; and from database systems to Internet search engines, they have become essential parts of modern software systems. As the scope of computer applications becomes more widespread, so grows the impact of many of the basic methods covered here. The goal of this book is to serve as a resource for students and professionals interested in knowing and making intelligent use of these fundamental algorithms as basic tools for whatever computer application they might undertake.
　　 Scope
　　 The book contains l6 chapters grouped into four major parts: fundamentals, data structures, sorting, and searching. The descriptions here are intended to give readers an understanding of the basic properties of as broad a range of fundamental algorithms as possible. The algorithms described here have found widespread use for years, and represent an essential body of knowledge for both the practicing progranuner and the computer-science student. Ingenious methods rang-
　　ing from binomial queues to patricia tries are described, all related to basic paradigms at the heart of computer science. The second volume consists of four additional parts that cover stririgs, geometry graphs, and advanced topics. My prdriary goal in developing these books has
　　been to bring together the fundamental methods from these diverse ar eas, to provide access to the best methods known for solving problems by computer.
　　 You will most appreciate the material in this book if you have had one or two previous courses in computer science or have had equivalent prograrruning experience: one course in programrning in a high-level language such as C++, Java, or C, and Perhaps another course that
　　teaches fundamental concepts of prograedng systems. This book is thus intended for anyone conversant with a modern programming language and with the basic features of modern computer systems.
　　 References that might help to fill in gaps in your background are suggested in the text.
　　 Most of the mathematical material supporting the analytic results is self-contained (or is labeled as beyond the scope of this book), so little specific preparation in mathematics is reqnired for the bulk of the book, although mathematical maturity is dethetely helpful.
　　Use in the Curriculum There is a great deal of nexibility in how the material here can be taught, depending on the taste of the instructor and the preparation of the students. There is sufficient coverage of basic material for the book to be used to teach data structures to beginners, and there is sufficient detail and coverage of advanced material for the book to be used to teach the design and analysis of algorithms to upper-level students. Some instructors may wish to emphasise implementations and practical concerns; others may wish to emphasize analysis and theoretical concepts.
　　 I am developing a variety of course materials for use with this book, including slide masters for use in lectures, programming assignments, homework assigrunnts and sample exams, and interactive exercises for students. These materials will be accessible via the book's home page at http: //www. av1. com/cseng/titles/0-201-35088-2.
　　 An elementary course on data structures and algorithms migh emphasize the basic data structures in Part 2 and their use in the implementations in Parts 3 and 4. A course on design and analysis of algorithms might emphasize the fundamental material in Part 1 and Chapter S, then study the ways in which the algorithms in Parts 3 and 4 achieve good asymptotic performance. A course on software engineering might omit the mathematical and advanced algoritfor material, and emphasize how to integrate the implementations given here 'into large programs or systems. A course on algorithms might take a survey approach and introduce concepts from all these areas.
　　Earlier editions of this book have been used in recent years at scores of colleges and universities around the world as a text for the second or third course in computer science and as supplemental reading for other courses. At Princeton, our experience has been that the breadth of coverage of material in this book provides our majors with an introduction to computer science that can be expanded upon in later courses on analysis of algorithms, systems programming and
　　theoretical computer science, while providing the growing group of students from other disciplines with a large set of techniques that these people can immediately put to good use.
　　 The exercises——most of which are new to this edition——fall into several types. Some are intended to test understanding of material in the text, and simply ask readers to work through an example or to apply concepts described in the text. Others involve implementing and putting together the algorithms, or running empirical studies to compare variants of the algorithms and to learn their properties. Still others are a repository for important information at a level of detail that is not appropriate for the text. Reading and thinking about the exercises will pay dividends for every reader.
　　 Algorithms of Practical Use
　　 Anyone wanting to use a computer more effectively can use this book for reference or for self study People with programming experience can find information on specific topics throughout the book. To a large extent, you can read the individual chapters in the book independently of the others, although, in some cases, algorithms in one chapter make use of methods from a previous chapter.