【文件属性】：
文件名称：c++数据结构与算法实现
文件大小：308KB
文件格式：ZIP
更新时间：2021-09-22 17:26:26
c++ 数据结构
matrix.h: Simple matrix class
dsexceptions.h: Simple exception classes
Fig01_02.cpp: A simple recursive routine with a test program
Fig01_03.cpp: An example of infinite recursion
Fig01_04.cpp: Recursive routine to print numbers, with a test program
Fig01_05.cpp: Simplest IntCell class, with a test program
Fig01_06.cpp: IntCell class with a few extras, with a test program
IntCell.h: IntCell class interface (Fig 1.7)
IntCell.cpp: IntCell class implementation (Fig 1.8)
TestIntCell.cpp: IntCell test program (Fig 1.9) (need to compile IntCell.cpp also)
Fig01_10.cpp: Illustration of using the vector class
Fig01_11.cpp: Dynamically allocating an IntCell object (lame)
BuggyIntCell.cpp: Buggy IntCell class implementation (Figs 1.16 and 1.17)
Fig01_18.cpp: IntCell class with pointers and Big Five
FindMax.cpp: Function template FindMax (Figs 1.19 and 1.20)
Fig01_21.cpp: MemoryCell class template without separation
Fig01_25.cpp: Using function objects: Case insensitive string comparison
LambdaExample.cpp: (Not in the book): rewriting Fig 1.25 with lambdas
MaxSumTest.cpp: Various maximum subsequence sum algorithms
Fig02_09.cpp: Test program for binary search
Fig02_10.cpp: Euclid's algorithm, with a test program
Fig02_11.cpp: Recursive exponentiation algorithm, with a test program
RemoveEveryOtherItem.cpp: Remove every other item in a collection
Vector.h: Vector class
List.h: List class
BinarySearchTree.h: Binary search tree
TestBinarySearchTree.cpp: Test program for binary search tree
AvlTree.h: AVL tree
TestAvlTree.cpp: Test program for AVL trees
mapDemo.cpp: Map demos
WordLadder.cpp: Word Ladder Program and Word Changing Utilities
SeparateChaining.h: Header file for separate chaining
SeparateChaining.cpp: Implementation for separate chaining
TestSeparateChaining.cpp: Test program for separate chaining hash tables (need to compile SeparateChaining.cpp also)
QuadraticProbing.h: Header file for quadratic probing hash table
QuadraticProbing.cpp: Implementation for quadratic probing hash table
TestQuadraticProbing.cpp: Test program for quadratic probing hash tables (need to compile QuadraticProbing.cpp also)
CuckooHashTable.h: Header file for cuckoo hash table
CuckooHashTable.cpp: Implementation for cuckoo hash table
TestCuckooHashTable.cpp: Test program for cuckoo hash tables (need to compile CuckooHashTable.cpp also)
CaseInsensitiveHashTable.cpp: Case insensitive hash table from STL (Figure 5.23)
BinaryHeap.h: Binary heap
TestBinaryHeap.cpp: Test program for binary heaps
LeftistHeap.h: Leftist heap
TestLeftistHeap.cpp: Test program for leftist heaps
BinomialQueue.h: Binomial queue
TestBinomialQueue.cpp: Test program for binomial queues
TestPQ.cpp: Priority Queue Demo
Sort.h: A collection of sorting and selection routines
TestSort.cpp: Test program for sorting and selection routines
RadixSort.cpp: Radix sorts
DisjSets.h: Header file for disjoint sets algorithms
DisjSets.cpp: Efficient implementation of disjoint sets algorithm
TestFastDisjSets.cpp: Test program for disjoint sets algorithm
WordLadder.cpp: Word Ladder Program and Word Changing Utilities
Fig10_38.cpp: Simple matrix multiplication algorithm with a test program
Fig10_40.cpp: Algorithms to compute Fibonacci numbers
Fig10_43.cpp: Inefficient recursive algorithm (see text)
Fig10_45.cpp: Better algorithm to replace fig10_43.c (see text)
Fig10_46.cpp: Dynamic programming algorithm for optimal chain matrix multiplication, with a test program
Fig10_53.cpp: All-pairs algorithm, with a test program
Random.h: Header file for random number class
Random.cpp: Implementation for random number class
TestRandom.cpp: Test program for random number class
UniformRandom.h: Random number class using standard library
Fig10_63.cpp: Randomized primality testing algorithm, with a test program
SplayTree.h: Top-down splay tree
TestSplayTree.cpp: Test program for splay trees
RedBlackTree.h: Top-down red black tree
TestRedBlackTree.cpp: Test program for red black trees
Treap.h: Treap
TestTreap.cpp: Test program for treap
SuffixArray.cpp: Suffix array
KdTree.cpp: Implementation and test program for k-d trees
PairingHeap.h: Pairing heap
TestPairingHeap.cpp: Test program for pairing heaps
MemoryCell.h: MemoryCell class interface (Appendix)
MemoryCell.cpp: MemoryCell class implementation (Appendix)
MemoryCellExpand.cpp: MemoryCell instantiation file (Appendix)
TestMemoryCell.cpp: MemoryCell test program (Appendix)
【文件预览】：
code
----TestSeparateChaining.cpp(706B)
----DisjSets.cpp(1KB)
----Fig01_23.cpp(1KB)
----mapDemo.cpp(471B)
----Fig01_03.cpp(228B)
----TestTreap.cpp(1KB)
----BinarySearchTree.h(8KB)
----Fig10_53.cpp(2KB)
----TestSlowDisjSets.cpp(2KB)
----matrix.h(979B)
----IntCell.cpp(311B)
----Fig10_38.cpp(818B)
----Fig10_46.cpp(2KB)
----Fig01_21.cpp(652B)
----MemoryCell.cpp(471B)
----DisjSets.h(762B)
----TestBinomialQueue.cpp(738B)
----Random.cpp(1KB)
----Fig01_05.cpp(751B)
----TailRecursion.cpp(864B)
----TestRandom.cpp(206B)
----SeparateChaining.h(3KB)
----QuadraticProbing.cpp(625B)
----CaseInsensitiveHashTable.cpp(1KB)
----RadixSort.cpp(3KB)
----Fig01_10.cpp(299B)
----Sort.h(10KB)
----SuffixArray.cpp(12KB)
----Fig01_04.cpp(282B)
----TestCuckooHashTable.cpp(2KB)
----MaxSumTest.cpp(3KB)
----Fig01_11.cpp(228B)
----TestSplayTree.cpp(1KB)
----TestBinaryHeap.cpp(915B)
----TestSort.cpp(2KB)
----TestRedBlackTree.cpp(974B)
----MemoryCell.h(335B)
----TestPQ.cpp(773B)
----Random.h(784B)
----Fig01_02.cpp(217B)
----RemoveEveryOtherItem.cpp(1KB)
----LambdaExample.cpp(974B)
----PairingHeap.h(9KB)
----TestMemoryCell.cpp(295B)
----dict.txt(860KB)
----TestBinarySearchTree.cpp(1KB)
----TestLeftistHeap.cpp(730B)
----CuckooHashTable.h(7KB)
----Fig10_43.cpp(342B)
----TestPairingHeap.cpp(1022B)
----Fig01_25.cpp(1KB)
----Fig02_09.cpp(941B)
----Fig10_40.cpp(727B)
----Fig02_10.cpp(346B)
----Fig01_06.cpp(468B)
----MemoryCellExpand.cpp(131B)
----Fig01_18.cpp(1KB)
----Fig10_63.cpp(1KB)
----List.h(7KB)
----UniformRandom.h(5KB)
----WordLadder.cpp(10KB)
----TestIntCell.cpp(227B)
----AvlTree.h(10KB)
----Fig01_24.cpp(822B)
----CuckooHashTable.cpp(896B)
----BinaryHeap.h(4KB)
----Treap.h(7KB)
----BuggyIntCell.cpp(619B)
----IntCell.h(263B)
----SplayTree.h(9KB)
----TestAvlTree.cpp(1KB)
----RedBlackTree.h(8KB)
----TestQuadraticProbing.cpp(704B)
----index.html(10KB)
----LeftistHeap.h(6KB)
----FindMax.cpp(1KB)
----Fig10_45.cpp(418B)
----BinomialQueue.h(8KB)
----KdTree.cpp(2KB)
----Vector.h(4KB)
----QuadraticProbing.h(4KB)
----SeparateChaining.cpp(899B)
----dsexceptions.h(283B)
----TestList.cpp(4KB)
----Fig02_11.cpp(454B)
----TestFastDisjSets.cpp(702B)
----TestVector.cpp(969B)