johnson算法c语言,Data Structures and Algorithm Analysis in C - （数据结构和算法分析C -）.pdf...

Data Structures and Algorithm Analysis in C - (数据结构和算法分析C -)

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:\Data.Structures.and.Algorithm.Analysis.in.C.chm::/... 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 of organizing large amounts of data,

and algorithm analysis, the estimation of the running time of algorithms. As

computers become faster and faster, the need for programs that can handle large

amounts of input becomes more acute. Paradoxically, this requires more careful

attention to efficiency, since inefficiencies in programs become 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 become more powerful, the problems they solve have become larger

and more complex, thus requiring development of more intricate programs to solve

the problems. The goal