本書提供作譯者介紹Jon Bentley是位于新澤西州Murray Hill的朗訊貝爾實(shí)驗(yàn)室計(jì)算機(jī)科學(xué)研究中心的技術(shù)委員會(huì)委員。自1998年以來(lái),作為Dr.Dobb's Journal雜志的特約編輯,他所負(fù)責(zé)的Programming Pearls專欄多年來(lái)一直是頂級(jí)學(xué)術(shù)雜志The Communications of the ACM最受歡迎的特色專欄之一,而本書的主要內(nèi)容就取材于該專欄。...
圖書目錄
Part I:PRELIMINARIES Column 1:Cracking the OysIer A Frielldly Conversation.Precise Problem Statement.Program Design. Implementation Sketch·Principles.Problems.Further Reading Column 2:Aha!Algorithms Three Problems.Ubiquitous Binary Search.The Power of Primitiyes. 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 fbr SpeciaIized Data.Principles.Prob- lems·Further Reading Column 4:Writing Correct Programs The Challenge 0f 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 Pselldocode to C·A Test Harness.The Art Of AssertiOn.Auto. mated Testing·Timing·The Complete Program.PrincIples.PmbIems ·Further Rcading.Debllgging Pan II:PERFORMANCE Column 6:PersDective on Performance A Case Study·Design Levels.PrillCiples.Problems.Further Readirig Colamrl 7:The Back of the Envelooe Basic Skills·Performance Estimates.Safetv Factors.Little’s Law. Principles·Problems·Further Reading.Quick Calculali‘ons in Everyday Life Columll 8:A1gorithm Design Techniques The Problem alld a Simple Algorithm.Two Quadratic Algorithms.A Divide—and—Conquer Algorithm·A Scanning AlgOrithm.What Does It Matter?·Prilieiples.Problems.Further Reading Column 9:Code Tuning A Typical Story·A Fjrst Aid sampIer·Major surgery—Binary search. Principles.ProbIems.Further ReadinReading Column 1 0:Squeezing Space The Key—Simplicity· An Illustrative Problem.Techniques for Data space · Techniques fbr code space .Principles . Problems , Further Reading·A Big Squeeze Pan III:THE PRODUCT Column11:Sorting Insenion Sort · A Simple Quicksort .Better Quicksorts .Principles . Problems·Further Reading Column 1 2:A Sample Problem Thpe Problem·One solution·The Design space.PrincipIes.Problems .FurtherReading Column 1 3:Searching The Interface·Linear Structures.Binary SearCh Trecs.Structurcs fbr Integers·Principles·Problems·Further Reading.A Real searching Problem Column l 4:Heaps The Date 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 Epilog to the First Editioil EpiIog to the Second Edition Appendix 1:A CataIog of Algorithins Appendix 2:An Estiiiiation Quiz Appendix 3:Cost Models for Time and Space Appendix 4:RuIes for Code Tuning Appendix 5:C++CIasses for Se8I'ching Hints for Selected Problems SoIutions to SeIected Probleins Index