文件名称:code
介绍说明－－下载内容均来自于网络，请自行研究使用
Mark Allen Weiss
1987年在普林斯顿大学获得计算机科学博士学位,师从著名算法大师Robert Sedgewick,现任美国佛罗里达国际大学计算与信息科学学院教授.他曾经担任全美AP(Advanced Placement)考试计算机学科委员会的*(2000-2004).他的主要研究方向是数据结构,算法,和教育学.- In this second edition of his successful book, experienced teacher and author Mark Allen Weiss continues to refine and enhance his innovative approach to algorithms and data structures. Written for the advanced data structures course, this text highlights theoretical topics like abstract data types and the efficiency of algorithms, as well as performance and running time. This... (展开全部) In this second edition of his successful book, experienced teacher and author Mark Allen Weiss continues to refine and enhance his innovative approach to algorithms and data structures. Written for the advanced data structures course, this text highlights theoretical topics like abstract data types and the efficiency of algorithms, as well as performance and running time. This edition also includes a new chapter on advanced data structures and material on the Standard Template Library that conforms to the new standard. In addition, all code has been updated and tested on multiple platforms and confo
1987年在普林斯顿大学获得计算机科学博士学位,师从著名算法大师Robert Sedgewick,现任美国佛罗里达国际大学计算与信息科学学院教授.他曾经担任全美AP(Advanced Placement)考试计算机学科委员会的*(2000-2004).他的主要研究方向是数据结构,算法,和教育学.- In this second edition of his successful book, experienced teacher and author Mark Allen Weiss continues to refine and enhance his innovative approach to algorithms and data structures. Written for the advanced data structures course, this text highlights theoretical topics like abstract data types and the efficiency of algorithms, as well as performance and running time. This... (展开全部) In this second edition of his successful book, experienced teacher and author Mark Allen Weiss continues to refine and enhance his innovative approach to algorithms and data structures. Written for the advanced data structures course, this text highlights theoretical topics like abstract data types and the efficiency of algorithms, as well as performance and running time. This edition also includes a new chapter on advanced data structures and material on the Standard Template Library that conforms to the new standard. In addition, all code has been updated and tested on multiple platforms and confo
(系统自动生成,下载前可以参看下载内容)
下载文件列表
AATree.h
AvlTree.h
BinaryHeap.h
BinarySearchTree.h
BinomialQueue.h
DisjSets.h
dsexceptions.h
DSL.h
IntCell.h
LeftistHeap.h
List.h
matrix.h
MemoryCell.h
PairingHeap.h
QuadraticProbing.h
Random.h
RedBlackTree.h
SeparateChaining.h
Sort.h
SplayTree.h
Treap.h
Vector.h
BuggyIntCell.cpp
DisjSets.cpp
Fig01_02.cpp
Fig01_03.cpp
Fig01_04.cpp
Fig01_05.cpp
Fig01_06.cpp
Fig01_10.cpp
Fig01_11.cpp
Fig01_16.cpp
Fig01_19.cpp
Fig01_21.cpp
Fig01_22.cpp
Fig01_23.cpp
Fig02_09.cpp
Fig02_10.cpp
Fig02_11.cpp
Fig10_38.cpp
Fig10_40.cpp
Fig10_43.cpp
Fig10_45.cpp
Fig10_46.cpp
Fig10_53.cpp
Fig10_62.cpp
FindMax.cpp
IntCell.cpp
KdTree.cpp
mapDemo.cpp
MaxSumTest.cpp
MemoryCell.cpp
QuadraticProbing.cpp
Random.cpp
RefReturn.cpp
RemoveEveryOtherItem.cpp
SeparateChaining.cpp
TailRecursion.cpp
TestAATree.cpp
TestAvlTree.cpp
TestBinaryHeap.cpp
TestBinarySearchTree.cpp
TestBinomialQueue.cpp
TestDSL.cpp
TestFastDisjSets.cpp
TestIntCell.cpp
TestLeftistHeap.cpp
TestList.cpp
TestMemoryCell.cpp
TestPairingHeap.cpp
TestPQ.cpp
TestQuadraticProbing.cpp
TestRandom.cpp
TestRedBlackTree.cpp
TestSeparateChaining.cpp
TestSlowDisjSets.cpp
TestSort.cpp
TestSplayTree.cpp
TestTreap.cpp
TestVector.cpp
Vector.cpp
WordLadder.cpp
index.html
AvlTree.h
BinaryHeap.h
BinarySearchTree.h
BinomialQueue.h
DisjSets.h
dsexceptions.h
DSL.h
IntCell.h
LeftistHeap.h
List.h
matrix.h
MemoryCell.h
PairingHeap.h
QuadraticProbing.h
Random.h
RedBlackTree.h
SeparateChaining.h
Sort.h
SplayTree.h
Treap.h
Vector.h
BuggyIntCell.cpp
DisjSets.cpp
Fig01_02.cpp
Fig01_03.cpp
Fig01_04.cpp
Fig01_05.cpp
Fig01_06.cpp
Fig01_10.cpp
Fig01_11.cpp
Fig01_16.cpp
Fig01_19.cpp
Fig01_21.cpp
Fig01_22.cpp
Fig01_23.cpp
Fig02_09.cpp
Fig02_10.cpp
Fig02_11.cpp
Fig10_38.cpp
Fig10_40.cpp
Fig10_43.cpp
Fig10_45.cpp
Fig10_46.cpp
Fig10_53.cpp
Fig10_62.cpp
FindMax.cpp
IntCell.cpp
KdTree.cpp
mapDemo.cpp
MaxSumTest.cpp
MemoryCell.cpp
QuadraticProbing.cpp
Random.cpp
RefReturn.cpp
RemoveEveryOtherItem.cpp
SeparateChaining.cpp
TailRecursion.cpp
TestAATree.cpp
TestAvlTree.cpp
TestBinaryHeap.cpp
TestBinarySearchTree.cpp
TestBinomialQueue.cpp
TestDSL.cpp
TestFastDisjSets.cpp
TestIntCell.cpp
TestLeftistHeap.cpp
TestList.cpp
TestMemoryCell.cpp
TestPairingHeap.cpp
TestPQ.cpp
TestQuadraticProbing.cpp
TestRandom.cpp
TestRedBlackTree.cpp
TestSeparateChaining.cpp
TestSlowDisjSets.cpp
TestSort.cpp
TestSplayTree.cpp
TestTreap.cpp
TestVector.cpp
Vector.cpp
WordLadder.cpp
index.html