文档介绍：Structures, Algorithm Analysis: Table of Contents 页码,1/1
Data Structures and Algorithm Analysis
in C
by Mark Allen Weiss
PREFACE
CHAPTER 1: INTRODUCTION
CHAPTER 2: ALGORITHM ANALYSIS
CHAPTER 3: LISTS, STACKS, AND QUEUES
CHAPTER 4: TREES
CHAPTER 5: HASHING
CHAPTER 6: PRIORITY QUEUES (HEAPS)
CHAPTER 7: SORTING
CHAPTER 8: THE DISJOINT SET ADT
CHAPTER 9: GRAPH ALGORITHMS
CHAPTER 10: ALGORITHM DESIGN TECHNIQUES
CHAPTER 11: AMORTIZED ANALYSIS
mk:***@MSITStore:K:\::/... 2006-1-27
Structures, Algorithm Analysis: PREFACE 页码,1/4
PREFACE Return to Table of Contents Next Chapter
Purpose/Goals
This book describes data structures, methods anizing large amounts of data,
and algorithm analysis, the estimation of the running time of algorithms. As
computers e faster and faster, the need for programs that can handle large
amounts of input es more acute. Paradoxically, this requires more careful
attention to efficiency, since inefficiencies in programs e most obvious
when input sizes are large. By analyzing an algorithm before it is actually
coded, students can decide if a particular solution will be feasible. For
example, in this text students look at specific problems and see how careful
implementations can reduce the time constraint for large amounts of data from 16
years to less than a second. Therefore, no algorithm or data structure is
presented without an explanation of its running time. In some cases, minute
details that affect the running time of the implementation are explored.
Once a solution method is determined, a program must still be written. As
computers have e more powerful, the problems they solve have e larger
and plex, thus requiring development of more intricate programs to solve
the problems. The goal of this text is to teach students good programming and
algorithm analysis skills simultaneously so that they can develop such programs
with the maximum