软件说明：

Algorithms and Data Structures—The Science of Computing <br> Preface <br> Part I - The Science of Computing's Three Methods of Inquiry <br> Chapter 1 - What is the Science of Computing? <br> Chapter 2 - Abstraction: An Introduction to Design <br> Chapter 3 - Proof: An Introduction to Theory <br> Chapter 4 - Experimentation: An Introduction to the Scientific Method <br> Part II - Program Design <br> Chapter 5 - Conditionals <br> Chapter 6 - Designing with Recursion <br> Chapter 7 - Analysis of Recursion <br> Chapter 8 - Creating Correct Iterative Algorithms <br> Chapter 9 - Iteration and Efficiency <br> Chapter 10 - A Case Study in Design and Analysis: Efficient Sorting <br> Part III - Introduction to Data Structures <br> Chapter 11 - Lists <br> Chapter 12 - Queues and Stacks <br> Chapter 13 - Binary Trees <br> Chapter 14 - Case Studies in Design: Abstracting Indirection <br> Part IV - The Limits of Computer Science <br> Chapter 15 - Exponential Growth <br> Chapter 16 - Limits to Performance <br> Chapter 17 - The Halting Problem <br> Appendix A - Object-oriented Programming in Java <br> Appendix B - About the Web Site <br> Index <br> List of Figures <br> List of Tables <br> List of Listings, Theorems and Lemmas <br> List of Sidebars <br>