編程珠璣（英文版・第2版） pdf epub mobi txt 電子書 下載2025

想要找書就要到 小美書屋

立刻按 ctrl+D收藏本頁

你會得到大驚喜!!

多年以來，當程序員們推選齣最心愛的計算機圖書時，《編程珠璣》總是位列前列。正如自然界裏珍珠齣自細沙對牡蠣的磨礪，計算機科學大師Jon Bentley以其獨有的洞察力和創造力，從磨礪程序員的實際問題中凝結齣一篇篇不朽的編程“珠璣”。這些文章是《ACM通訊》最受歡迎的專欄文章，最終結集為兩部書齣版。本書為第一捲，主要討論計算機科學中最本質的問題：如何正確選擇和高效地實現算法。

在書中，作者選取許多具有典型意義的復雜編程和算法問題，生動描繪瞭曆史上眾多大師們在探索解決方案中發生的軼事、走過的彎路和不斷精益求精的曆程，引導讀者開展創新性的思考。書中透徹闡述和總結瞭許多獨特而精妙的設計原則、思考和解決問題的方法以及實用程序設計技巧。解決方案的代碼均以C/C++語言編寫，不僅有趣，而且有很大的實戰示範意義。每章後所附習題極具挑戰性和啓發性，書末給齣瞭簡潔的解答。

1953年2月20日齣生於美國加州長灘。1974年畢業於斯坦福大學數學係，1976年獲北卡羅來納大學博士學位。他先後任職於卡內基一梅隆大學(1976—1982)、貝爾實驗窒(1982—2001)和Avaya實驗室(2001年至今)。在卡內基一梅隆大學任教期間。他培養瞭許多後來知名的計算機大傢，包括Scribe的開發者Brian Reid，Tcl語言設計者John Ousterhout。Java專傢Joshua Btoch，Java語言設計者James Gosling，《算法導論》作者之—Charles Leiserson。2004年榮獲Dr.Dobb's程序設計卓越奬。

CONTENTS
Part I: PRELIMINARIES 1
Column 1: Cracking the Oyster 3
A Friendly Conversation ~ Precise Problem Statement ~ Program Design ~
Implementation Sketch. Principles ~ Problems. Further Reading
Column 2: Aha! Algorithms 11
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 21
A Survey Program ~ Form-Letter Programming ~ An Array of Examples ~
Structuring Data. Powerful Tools for Specialized Data ~ Principles ~ Prob-
lems ~ Further Reading
Column 4: Writing Correct Programs 33
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 45
From Pseudocode to C ~ A Test Harness ~ The Art of Assertion ~ Auto-
mated Testing ~ Timing ~ The Complete Program. Principles ~ Problems
~ Further Reading ~ Debugging
Part II: PERFORMANCE 59
Column 6: Perspective on Performance 61
A Case Study. Design Levels. Principles. Problems ~ Further Reading
Column 7: The Back of the Envelope 67
Basic Skills ~ Performance Estimates ~ Safety Factors ~ Little's Law ~
Principles ~ Problems ~ Further Reading ~ Quick Calculations in Everyday
Life
Column 8: Algorithm Design Techniques 77
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 87
A Typical Story ~ A First Aid Sampler ~ Major Surgery Binary Search ~
Principles. Problems. Further Reading
Column 10: Squeezing Space 99
The Key Simplicity ~ An Illustrative Problem. Techniques for Data
Space. Techniques for Code Space ~ Principles ~ Problems ~ Further
Reading ~ A Big Squeeze
Part III: THE PRODUCT 113
Column 11: Sorting 115
Insertion Sort ~ A Simple Quicksort ~ Better Quicksorts ~ Principles ~
Problems ~ Further Reading
Column 12: A Sample Problem 125
The Problem ~ One Solution. The Design Space. Principles ~ Problems
~ Further Reading
Column 13: Searching 133
The Interface ~ Linear Structures ~ Binary Search Trees ~ Structures for
Integers. Principles. Problems. Further Reading. A Real Searching
Problem
Column 14: Heaps 147
The Data Structure ~ Two Critical Functions ~ Priority Queues ~ A Sorting
Algorithm. Principles. Problems. Further Reading
Column 15: Strings of Pearls 161
Words ~ Phrases ~ Generating Text ~ Principles ~ Problems ~ Further
Reading
Epilog to the First Edition 175
Epilog to the Second Edition 177
Appendix 1: A Catalog of Algorithms 179
Appendix 2: An Estimation Quiz 183
Appendix 3: Cost Models for Time and Space 185
Appendix 4: Rules for Code Tuning 191
Appendix 5: C++ Classes for Searching 197
Hints for Selected Problems 201
Solutions to Selected Problems 205
Index 233
· · · · · · (收起)