算法I~IV（C++实现）——基础、数据结构、排序和搜索（第三版英文影印版）|国外优秀信息科学与技术系列教学用书|Robert Sedgewick|高等教育出版社

[放大封面]

【相关下载】

【二手书】
本产品共有 0 册二手书出售，最低价：￥.00 [查看]

推荐图书

	有限元方法（第5版）第3卷... 作者:（英）监凯维奇，（美）泰勒著，符松，刘扬扬译
	有限元方法基础理论（第六... 作者:（英）监凯维奇
	有限元方法的数学理论（第... 作者:（美）布雷
	有限单元法原理及应用简明... 作者:高秀华
	应用计算方法教程作者:张晓丹
	科学和工程计算基础——工... 作者:施妙根，顾丽珍编著

用户购买本书还购买了

· CLASSICAL MECHANICS(THIRD EDIT...

· 算法V（C++实现）——图算法（第...

· 分析学分析与管理

· 数字集成电路——设计透视（影印...

· CMOS射频集成电路设计(第二版)(...

· Absolute C＋＋（英文版.第2版）

· C 语言的科学和艺术（英文版）

· MATLAB编程（英文影印版第二版）

· 并行程序设计（英文版）

· 电路（第七版）（英文影印版）(...

金书共建·What's this?

[分类共建] ·所有未分类图书查看
本书当前分类：
计算数学 > 综合
我觉得本书应分到此类中：

[金书WIKI]
[ 编辑 ]当前页面使本书内容更加完善

[资源共建]
·提交本书书摘 ·提交本书相关资源

算法I~IV（C++实现）——基础、数据结构、排序和搜索（第三版英文影印版）

您想读这本书吗？
原书名：Algorithms in C++,Parts 1-4:Fundamentats,Data Structures,Sorting,and Searching,3e	原出版社：Pearson Education
作者： Robert Sedgewick	出版社：高等教育出版社
译者：	丛书名：国外优秀信息科学与技术系列教学用书
出版日期：2002-10-1	上架日期：2005-10-8
ISBN：7040113988	页数：版次：1-1
开本：16开	装帧：

市场价：~~￥49.00~~

贵宾会员价：￥39.20
高级会员价：￥40.67
普通会员价：￥41.65

金书豆豆(What's this?)

种一个豆豆，书价我来定！

我要种一个豆豆

【您的购物车】

购买册数：


货到付款：北京、上海、天津、广州、深圳、湖北、河南、山西、陕西、山东、四川、重庆、浙江更多查看>>

[暂时缺货，正在进货您可以在此处进行缺货登记,到货后我们会及时通知您！]

| 大封面 | 封底 | 前言 | 内容简介 | 序言 | 目录 | 作者简介 | 译者简介 | 作者序 | 译者序 |

【读者评论】

内容简介
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

Chapter 3. Elementary Data Structures 69
3.1 Building Blocks' 70
3.2 Arrays' S3
3.3 Linked Lists' 91
3.4 Elementary List Processing' 97
3.5 Memory Allocation for Lists' 106
3.6 Strings' 110
3.7 Compound Data Structures' 116

Chapter 4. Abstract Data Types 129
4.l Abstract Objects and Collections of Objects' 140
4.2 Pushdown Stack ADT' 144
4.3 Examples of Stack ADT Clients' 147
4.4 Stack ADT Implementations' 1s3
4.S Creation of a New ADT' 1s8
4.6 FIFO Queues and Generalized Queues' 166
4.7 Duplicate and Index Items' 17S
4.8 First-Class ADTs' 179
4.9 Application-Based ADT Example' 192
4.10 Perspective' 198

Chapter 5. Recursion and Trees 201
5.1 Recursive Algorithms' 202
5.2 Divide and Conquer' 210
5.3 Dynamic Programming' 222
5.4 Trees' 230
5.5 Mathematical Properties of Trees' 240
5.6 Tree Traversal' 243
5.7 Recursive Binary-Tree Algorithms' 249
5.8 Graph Traversal' 2sS
5.9 Perspective' 261
Sorting

Chapter 6. Elementary Sorting Methods 265
6.1 Rules of the Game' 267
6.2 Selection Sort' 273
6.3 Insertion Sort' 274
6.4 Bubble Sort' 277
6.5 Performance Characteristics of Elementary Sorts' 279
6.6 Shellsort  285
6.7 Sorting Other Types of Data' 293
6.8 Index and Pointer Sorting' 299
6.9 Sorting Linked Lists' 307
6.l0 Key-Indexed Counting' 312

Chapter 7. Quicksort 315
7.1 The Basic Algorithm' 316
7.2 Performance Characteristics of Quicksort 321
7.3 Stack Size' 325
7.4 Small Subfiles 328
7.5 Median-of-Three Partitioning' 331
7.6 Duplicate Keys' 336
7.7 Strings and Vectors' 339
7.8 Selection' 341

Chapter 8. Merging and Mergesort 347
8.l Two-Way Merging' 348
8.2 Abstract In-Place Merge' 351
8.3 Top-Down Mergesort 353
8.4 Improvements to the Basic Algorithm' 357
8.5 Bottom-UP Mergesort 359
8.6 Performance Characteristics of Mergesort 363
8.7 Linked-List Implementations of Mergesort 366
8.8 Recursion Revisited' 370

Chapter 9. Priority Queues and Heapsort 373
9.1 Elementary Implementations' 377
9.2 Heap Data Structure' 381
9.3 Algorithms on Heaps' 383
9.4 Heapsort 389
9.5 Priority-Queue ADT' 396
9.6 Priority Queues for Index Items' 402
9.7 Binomial Queues' 406

Chapter 10. Radix Sorting 417
10.1 Bits, Bytes, and Words' 419
10.2 Binary Quicksort 423
10.3 MSD Radis Sort' 427
10.4 Three-Way Radin Quicksort 43S
10.S LSD Radis Sort' 439
10.6 Performance Characteristics of Radix Sorts' 442
10.7 Sublinear-Time Sorts' 447

Chapter 11. Spedal-Purpose Sorts 451
11.1 Batcher's Odd-Even Mergesort' 4s3
11.2 Sorting Networks' 458
1l.3 External Sorting' 466
11.4 Sort-Merge Implementations' 472
11.5 Parallel Sort/Merge' 478
Searching

Chapter 12. Symbol Tables and BSTs  489
12.1 Symbol-Table Abstract Data Type' 491
12.2 Key-Indexed Search' 499
12.3 Sequential Search' 502
12.4 Binary Search' 510
12.5 Binary Search Trees (BSTs)' 515
12.6 Performance Characteristics of BSTs' 521
12.7 Index Implementations with Symbol Tables' 525
12.8 Insertion at the Root in BSTs' 529
12.9 BST Implementations of Other ADT Functinns' 533

Chapter 13. Balanced Trees 543
13.1 Randomized BSTs' 547
13.2 Splay BSTs' 554
13.3 Top-Down 2-3-4 Trees' 560
13.4 Red-Black Trees' 565
13.5 Skip Lists' 576
13.6 Performance Characteristics' 583

Chapter 14. Hashing 587
14.1 Hash Functions' 588
14.2 Separate Chaining' 597
14.3 Linear Probing' 602
14.4 Double Hashing' 608
14.5 Dynadric Hash Tables' 6l3
14.6 Perspective' 617

Chapter 15. Radit Search 623
15.1 Digital Search Trees' 624
15.2 Tries' 628
15.3 Patricia Tries' 637
15.4 Multiway Tries and TSTs' 646
15.5 Text String Index Applications' 664

Chapter 16. External Searching 669
16.1 Rules of the Game' 671
16.2 Indexed Sequential Access' 674
16.3 B Trees' 676
16.4 Extendible Hashing' 691
16.5 Perspective' 703
Index 707

伸缩显示:

[弹出查看]

编辑荐语

[您可以向编辑推荐本书的亮点，采纳后奖励５－１０元优惠卷]（一个工作日内处理您的建议）

本套教学用书的特点：
权威性——教育部高等教育司推荐、教育部高等学校信息科学与技术引进教材专家组遴选。
系统性——覆盖计算机专业主干课程和非计算机专业计算机基础课程。
先进性——著名计算机专家近两年的最新著作，内容体系先进。
经济性——价格与国内自编教材相当、是国内引进教材价格最低的。

读者评论 w 查看本书所有书评

[发表您的书评，编辑将根据书评质量，予以相应的奖励]

(共0条)

关于我们 | 帮助 | 合作伙伴 | 我的帐户 | 图书馆 | 自考教材网 | 高校教材网
北京电话：010-68993821/88379639/88379641 邮箱：service@golden-book.com 传真：010-68990188
京ICP证060035号

专题 | 特价 | 书评 | 论坛 | 下载 | 新品 | 豆豆 | 鉴委会 | 共建 | 编辑博客 | 抢鲜预订 | 样章试读 | 名人签名 | 格子 | 播报

我的订单

关于配送

关于付款

售后服务

金书网