Location:
Search - batcher
Search list
Description: 经典算法书(中文版).《C算法》介绍了当今最重要的算法，共分3卷，本书是第1卷。第1卷分4部分、共16章。第一部分“基础知识”（第1～2章）介绍了基本算法分析原理。第二部分“数据结构”（第3～5章）讲解算法分析中必须掌握的数据结构知识。主要包括基本数据结构、抽象数据结构、递归和树。第三部分“排序”（第6～11章）按章节顺序分别讨论了基本排序方法（如选择排序、插入排序、冒泡排序、希尔排序等）、快速排序方法，归并和归并排序方法、优先队列与堆排序方法、基数排序方法以及特殊目的排序方法，并比较了各种排序方法的性能特征。第四部分“搜索”（第12～16章）在进一步讲解符号表、树等抽象数据类型的基础上，重点讨论哈希方法、基数搜索以及外部搜索方法。-This particular book, Parts 1-4, represents the essential first half of Sedgewick s complete work. It provides extensive coverage of fundamental data structures and algorithms for sorting, searching, and related applications. The algorithms and data structures are expressed in concise implementations in C, so that you can both appreciate their fundamental properties and test them on real applications. Of course, the substance of the book applies to programming in any language.
Highlights
* Expanded coverage of arrays, linked lists, strings, trees, and other basic data structures
* Greater emphasis on abstract data types (ADTs) than in previous editions
* Over 100 algorithms for sorting, selection, priority queue ADT implementations, and symbol table ADT (searching) implementations
* New implementations of binomial queues, multiway radix sorting, Batcher s sorting networks, randomized BSTs, splay trees, skip lists, multiway tries, and much more
* Increased quantit
Platform: |
Size: 19883008 |
Author: wang |
Hits: