±à³ÌÖéçá-(Ó¢ÎÄ°æ.µÚ2°æ)

part i: preliminaries¡¡

column 1: cracking the oyster¡¡
a friendly conversation¡¤precise problem statement¡¤program design¡¤implementation sketch¡¤principles¡¤problems¡¤further reading

column 2: aha! algorithms¡¡
three problems¡¤ubiquitous binary search¡¤the power of primitives¡¤getting it together: sorting¡¤principles¡¤problems¡¤further reading¡¤implementing an anagram program

column 3: data structures programs¡¡
a survey program¡¤form-letter programming¡¤an array of examples¡¤structuring data¡¤powerful tools for specialized data¡¤principles¡¤problems¡¤further reading

column 4: writing correct programs¡¡
the challenge of binary search¡¤writing the program¡¤understanding the program¡¤principles¡¤the roles of program verification¡¤problems¡¤further reading

column 5: a small matter of programming¡¡
from pseudocode to c¡¤a test harness¡¤the art of assertion¡¤automated testing¡¤timing¡¤the complete program¡¤principles¡¤problems¡¤further reading¡¤debugging

part ii: performance¡¡

column 6: perspective on performance¡¡
a case study¡¤design levels¡¤principles¡¤problems¡¤further reading

column 7: the back of the envelope¡¡
basic skills¡¤performance estimates¡¤safety factors¡¤little's law¡¤principles¡¤problems¡¤further reading¡¤quick calculations in everyday life

column 8: algorithm design techniques¡¡
the problem and a simple algorithm¡¤two quadratic algorithms¡¤a divide-and-conquer algorithm¡¤a scanning algorithm¡¤what does it matter?¡¤principles¡¤problems¡¤further reading

column 9: code tuning¡¡7
a typical story¡¤a first aid sampler¡¤major surgery¡ª¡ªbinary search¡¤principles¡¤problems¡¤further reading

column 10: squeezing space¡¡
the keysimplicity¡¤an illustrative problem¡¤techniques for data space¡¤techniques for code space¡¤principles¡¤problems¡¤further reading¡¤a big squeeze

part iii: the product¡¡

column 11: sorting 115
insertion sort¡¤a simple quicksort¡¤better quicksorts¡¤principles¡¤problems¡¤further reading

column 12: a sample problem¡¡
the problem¡¤one solution¡¤the design space¡¤principles¡¤problems¡¤further reading

column 13: searching¡¡
the interface¡¤linear structures¡¤binary search trees¡¤structures for integers¡¤principles¡¤problems¡¤further reading¡¤a real searching problem

column 14: heaps¡¡
the data structure¡¤two critical functions¡¤priority queues¡¤a sorting algorithm¡¤principles¡¤problems¡¤further reading

column 15: strings of pearls¡¡
words¡¤phrases¡¤generating text¡¤principles¡¤problems¡¤further reading

epilog to the first edition¡¡
epilog to the second edition¡¡

appendix 1: a catalog of algorithms¡¡
appendix 2: an estimation quiz¡¡
appendix 3: cost models for time and space¡¡
appendix 4: rules for code tuning¡¡
appendix 5: c++ classes for searching¡¡

hints for selected problems¡¡
solutions to selected problems¡¡
index