Data_Structures_and_Algorithm_Analysis_in_C.pdf下载分享

资料简介

《Data Structures and Algorithm Analysis in C》由Mark Allen Weiss编著，涵盖数据结构、算法设计和效率分析等内容，适合计算机科学专业学生及编程爱好者阅读。本书深入浅出地讲解了算法的实现及其性能优化方法。

• 文件名称：Data_Structures_and_Algorithm_Analysis_in_C.pdf

• 文件类型：PDF文档

• 文件标签：数据结构、算法分析、C语言

内容预览

Data Structures and Algorithm
Data Structures and Algorithm
Data Structures and Algorithm
Data Structures and Algorithm
Analysis in C
Analysis in C
Analysis in C
Analysis in C
by Mark Allen Weiss
by Mark Allen Weiss
by Mark Allen Weiss
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
Page 1 of 1
Structures, Algorithm Analysis: Table of Contents
2010-5-13
mk:@MSITStore:C:\Reference\Books\algorithms\Dr.%20Dobb%60s%2010%20部算...

PREFACE
PREFACE
PREFACE
PREFACE
Purpose/Goals
Purpose/Goals
Purpose/Goals
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 of this
text is to teach students good programming and algorithm analysis
skills simultaneously so that they can develop such programs with the
maximum amount of efficiency.
This book is suitable for either an advanced data structures (CS7)
course or a first-year graduate course in algorithm analysis.
Students should have some knowledge of intermediate programming,
including such topics as pointers and recursion, and some background
in discrete math.
Approach
Approach
Approach
Approach
I believe it is important for students to learn how to program for
themselves, not how to copy programs from a book. On the other hand,
it is virtually impossible to discuss realistic programming issues
without including sample code. For this reason, the book usually
provides about half to three-quarters of an implementation, and the
student is encouraged to supply the rest.
Page 1 of 5
Structures, Algorithm Analysis: PREFACE
2010-5-13
mk:@MSITStore:C:\Reference\Books\algorithms\Dr.%20Dobb%60s%2010%20部算...

The algorithms in this book are presented in ANSI C, which, despite
some flaws, is arguably the most popular systems programming
language. Th...