【内容简介】
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
<< 查看详细目录
【前言】
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 eng..
<< 查看前言