图书介绍

工作类型：数据结构与算法的 C++ 实现【2025|PDF下载-Epub版本|mobi电子书|kindle百度云盘下载】

Rick Decker，Stuart Hirshfield 著
出版社：北京;西安：世界图书出版公司
ISBN：7506238195
出版时间：1998
标注页数：495页
文件大小：46MB
文件页数：513页
主题词：

PDF下载

点此进入-本书在线PDF格式电子书下载【推荐-云解压-方便快捷】直接下载PDF格式图书。移动端-PC端通用
种子下载[BT下载速度快]温馨提示：（请使用BT下载软件FDM进行下载）软件下载地址页直链下载[便捷但速度慢] [在线试读本书] [在线获取解压码]

点击复制MD5值：114c6f7f12a340b2d5c550210cfdba57

下载说明

工作类型：数据结构与算法的 C++ 实现PDF格式电子书版下载

下载的文件为RAR压缩包。需要使用解压软件进行解压得到PDF格式图书。

点击复制85GB完整离线版磁力链接到迅雷FDM等BT下载工具进行下载详情点击-查看共享计划

建议使用BT下载工具Free Download Manager进行下载,简称FDM(免费,没有广告,支持多平台）。本站资源全部打包为BT种子。所以需要使用专业的BT下载软件进行下载。如BitComet qBittorrent uTorrent等BT下载工具。迅雷目前由于本站不是热门资源。不推荐使用！后期资源热门了。安装了迅雷也可以迅雷进行下载！

（文件页数要大于标注页数，上中下等多册电子书除外）

注意：本站所有压缩包均有解压码： 点击下载压缩包解压工具

图书目录

PART ONE INTRODUCTION3

1 PRELIMINARIES3

1.1 ADTs:ABSTRACTION AND ENCAPSULATION4

Abstraction5

Reuse and Encapsulation7

ADTs,OOP,and Things to Come7

1.2 ADT:INTEGERARRAY8

1.3 IMPLEMENTATION13

Defining Integer Arrays13

1.4 COMPUTER SCIENCE INTERLUDE:ASSERTIONS AND VERIFICATION18

Assertions18

Verification19

1.5 APPLICATION:MULTIPRECISION ARITHMETIC23

Declaring the Number Class25

Defining the Number Class27

1.6 SUMMARY36

1.7 EXERCISES36

1.8 EXPLORATIONS44

Representation of Integers44

Bit Vectors45

PART TWO LINEAR STRUCTURES45

2 LISTS49

2.1 ADT:LIST50

Parametrized Classes53

2.2 IMPLEMENTATIONS55

Arrays55

Linked Lists63

2.3 COMPARING IMPLEMENTATIONS75

Space75

Time76

Comprehensibility77

Trade-Offs78

2.4 COMPUTER SCIENCE INTERLUDE:MEASURES OF EFFICIENCY78

Algorithms79

Big-O81

Order Arichmetic83

Timing Functions85

2.5 APPLICATION:MEMORY MANAGEMENT89

Allocation92

Deallocation94

Compaction98

2.6 SUMMARY100

2.7 EXERCISES100

2.8 EXPLORATIONS111

Sorted Lists111

Self-Organizing Lists115

3 STRINGS117

3.1 ADT:STRING117

(S)trings,(s)trings,and Arrays118

Lexicographic Order121

Declaring Strings122

3.2 IMPLEMENTATION124

Efficiency130

3.3 APPLICATION:STRING MATCHING132

3.4 SUMMARY139

3.5 EXERCISES140

3.6 EXPLORATIONS144

Advanced Pattern Matching144

4 OTHER LINEAR STRUCTURES146

4.1 ADT:STACK146

4.2 IMPLEMENTATIONS OF STACK151

Efficiency Issues151

Sacks as a Derived Class152

Sacks from Scratch153

4.3 APPLICATION:POSTFIX ARITHMETIC154

4.4 ADT:QUEUE157

4.5 IMPLEMENTATIONS OF QUEUE158

Queues as Linked Lists159

Circular Arrays and Queues160

4.6 APPLICATION(CONTINUED):INFIX TO POSTFIX CONVERSION163

Verification166

4.7 SUMMARY166

4.8 EXERCISES167

4.9 EXPLORATIONS173

The Electronic Labyrintn173

Operating System Simulation178

PART THREE NONLINEAR STRUCTURES178

5 RECURSION183

5.1 RECURSIVE ALGORITHMS183

Induction and Recursion190

5.2 TIMING RECURSIVE ALGORITHMS191

5.3 COMPUTER SCIENCE INTERLUDE:DESIGN OF ALGORITHMS196

5.4 RECURSIVE DATA STRUCTURES202

General Lists and LISP204

5.5 SUMMARY211

5.6 EXERCISES212

5.7 EXPLORATIONS219

Quicksort219

6 TREES223

6.1 THE STRUCTURE OF TREES224

6.2 ADT:BINARYTREE228

6.3 BINARY TREE TRAVERSALS231

6.4 IMPLEMENTATION OF BINARYTREE236

6.5 COMPUTER SCIENCE INTERLUDE:PARSE TREES240

6.6 DATA-ORDERED BINARY TREES242

Binary Search Trees244

Application:Treesort251

6.7 SUMMARY252

6.8 EXERCISES253

6.9 EXPLORATIONS257

Threaded Trees257

Preamble:Tree Applications259

Huffman Codes261

Tries265

7 SPECIALIZED TREES268

7.1 BALANCED TREES269

AVL Trees270

Efficiency and Verification277

7.2 B-TREES277

k-ary Trees,Again278

B-Trees Explained279

Application:External Storage289

7.3 SUMMARY293

7.4 EXERCISES294

8 GRAPHS AND DIGRAPHS297

8.1 ADT:GRAPH298

8.2 IMPLEMENTATIONS OF GRAPH302

Adjacency Matrices302

Adjacency Lists and Edge Lists305

8.3 GRAPH TRAVERSALS311

Depth-First Traversals311

Breadth-First Traversals312

Spanning Trees314

8.4 APPLICATION:MINIMUM SPANNING TREES317

8.5 DIRECTED GRAPHS319

Application:Cheapest Paths320

8.6 COMPUTER SCIENCE INTERLUDE:COMPUTATIONAL COMPLEXITY326

8.7 SUMMARY330

8.8 EXERCISES331

8.9 EXPLORATIONS336

Topological Sorting336

Counting Paths338

9 UNORDERED COLLECTION342

9.1 ADT:SET342

9.2 IMPLEMENTATIONS OF SET345

Bit Vectors345

Sets Represented by Lists348

9.3 ADT:DICTIONARY352

Associations352

9.4 HASHING356

Open Hashing362

Time and Space Estimates363

9.5 APPLICATION:A PROBABILISTIC SPELLING CHECKER366

9.6 ADT:PRIORITYQUEUE369

Application:Heapsort375

9.7 SUMMARY376

9.8 EXERCISES377

9.9 EXPLORATIONS380

Hashing,Coninued380

The Disjoint Set ADT383

Tree Representations of Disjoint Set384

Application:Minimum Spanning Trees,Revisited389

10 TRAVESTY:PUTTING IT ALL TOGETHER391

10.1 THE PROBLEM391

10.2 THE SOLUTIONS396

Arrays397

Hashing401

Tries408

A Guest Author416

10.3 APPLICATIONS416

Reactive Keyboards417

Coding,Once Again418

10.4 SUMMARY419

10.5 EXERCISES420

10.6 EXPLORATIONS422

Long Strings422

APPENDIX A:A Pascal-C++ Dictionary425

A.1 Information426

A.2 Program Structure428

A.3 Statements430

A.4 Compound Data Types434

A.5 Pointers and References435

A.6 Two Sample Programs437

APPENDIX B:Topics in Mathematics444

B.1 Exponential and Logarithmic Functions444

B.2 Induction449

B.3 Counting Techniques451

B.4 Exercises455

APPENDIX C:Random Numbers and Simulation459

C.1 RandomNumbers460

C.2 Probability Distributions462

C.3 Selection Algorithms469

C.4 Exercises473

APPENDIX D:Specifications of the ADTs Used in the Text475

Index487