0

• 
  现代电视新闻学
  ￥11.20
• 
  西方行政学说史(第二版)
  ￥9.90
• 
  中日交流标准日本语(上下册)初级（内容一致，印次、封面或原价不同，统一售价，随机发货）
  ￥13.50
• 
  固体废物处理与资源化
  ￥17.60

本书自**版出版以来,已经成为世界范围内广泛使用的大学教材和专业人员的标准参考手册。本书全面论述了算法的内容,从一定深度上涵盖了算法的诸多方面,同时其讲授和分析方法又兼顾了各个层次读者的接受能力。各章内容自成体系,可作为独立单元学习。所有算法都用英文和伪码描述,使具备初步编程经验的人也可读懂。全书讲解通俗易懂,且不失深度和数学上的严谨性。第二版增加了新的章节,如算法作用、概率分析与随机算法、线性编程等,几乎对**版的各个部分都作了大量修订。

Preface
I Foundation
Introduction
1 The Role of Algorithms in Computing
1.1 Algorithms
1.2 Algorithms as a technology
2 Getting Started
2.1 Insertion sort
2.2 Analyzing algorithms
2.3 Designing algorithms
3 Growth of Functions
3.1 Asymptotic notation
3.2 Standard notations and common functions
4 Recurrences
4.1 The substitution method
4.2 The recursion-tree method
4.3 The master method
4.4 Proof of the master theorem
5 Probabilistic Analysis and Randomized Algorithms
5.1 The hiring problem
5.2 Indicator random variables
5.3 Randomized algorithms
5.4 Probabi1istic analysis and further uses of indicator
II Sorting and Order Statistics
Introduction
6 Heapsort
6.1 Heaps
6.2 Maintaining the heap property
6.3 Building a heap
6.4 The heapsort algorithm
6.5 Priority queues
7 Quicksort
7.1 Description of quicksort
7.2 Performance ofquicksort
7.3 A randomized version of quicksort
7.4 Analysis ofquicksort
8 Sorting in Linear Time
8.1 Lower bounds for sorting
8.2 Counting sort
8.3 Radix sort
8.4 Bucket sort
9 Medians and Order Statistics
9.1 Minimum and maximum
9.2 Selection in expected linear time
9.3 Selection in worst-case linear time
III Data Structures
Introduction
10 Elementary Data Structures
10.1 Stacks and queues
10.2 Linked lists
10.3 Implementing pointers and objects
10.4 Representing rooted trees
11 Hash Tables
11.1 Direct-address tables
11.2 Hash tables
11.3 Hash functions
11.4 Open addressing
11.5 Perfect hashing
12 Binary Search Trees
12.1 What is a binary search tree?
12.2 Querying a binary search tree
12.3 Insertion and deletion
12.4 Randoinly built binary search trees
13 Red-Black Thees
13.1 Properties of red-black trees
13.2 Rotations
13.3 Insertion
13.4 Deletion
14 Augmenting Data Structures
14.1 Dynamic order statistics
14.2 How to augment a data structure
14.3 Interval trees
IV Advanced Desthe and Analysis Techniques
……
V Advanced Data Structures
VI Graph Algorithms
VII Selected Topics
VIII Appendix: Mathematical Background
Bibliography
Index

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

Thomasd H.Cormen是达特茅斯学院计算机科学系副教授,Charles E.Leiserson是麻省理工学院计算机科学与电气工程系教授,Ronald L.Rivest是麻省理工学院计算机科学系教授,Clifford Stein是哥伦比亚大学工程与运营研究所副教授。