编程珠玑：英文本

定　价：¥28.00

作　者：	（美）Jon Bentley著
出版社：	中国电力出版社
丛编项：	原版风暴系列
标　签：	计算机/网络影印版

购买这本书可以去

ISBN：	9787508322056	出版时间：	2004-04-01	包装：	平装
开本：	23cm	页数：	256	字数：

内容简介

　　如果让程序员们列出他们最喜欢的书籍，Jon Bentley的《编程珠玑》通常可以位于经典之列。如同珍珠来自于曾经折磨牡蛎的沙粒，程序设计的珍珠也来自曾经折磨程序员的实际问题。Bentley的珍珠建立在坚实的工程学基础上，在洞察力和创造力的王国中为那些恼人的问题提供了独特而巧妙的解决方案。通过一些精心设计的有趣而且颇具指导意义的程序，本书对众多实用程序设计技巧及基本设计原则作了清晰而机智的描述。因此，《编程珠玑》得到各个层次程序员的青睐并不让人感觉意外。为了反映当今的程序设计方法和环境，Bentley在本书中彻底更新了第一版里的大多数素材。此外，他还新增加了以下三个方面的内容：·测试、调试和计时·集合表示字符中问题对原来的所有程序都重新进行了改写，并生成了等量的新代码。您可以从本书网站（www.programmingpearls.com）获取所有程序的C或C++实现。新版本中保持不变的是Bentley对程序设计问题本质的关注，以及他针对这些问题给出的优美解决方案。不论您是第一次阅读Bentley的经典，还是想再次领略他作品中的新观点，这本书都肯定会成为您最喜爱的图书之一。

作者简介

　　JonBentley是位于新泽西州的朗读贝尔实验室计算机科学研究中心的技术委员会委员，自1998年就成为《Dr.DobsJournal》杂志的特约编辑。他的“编程珠机”专栏多年来一直是顶级学术杂志《CommunicationsoftheACM》最风行的特色专栏之一，而本书正是建立在这些专栏的基础之上。

图书目录

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.
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.
A Typical Story.
A First Aid Sampler.
Major Surgery—Binary Search.
Principles.
Problems.
Further Reading.
Column 10. Squeezing Space.
The Key—Simplicity.
An Illustrative Problem.
Techniques for Data Space.
Techniques for Code Space.
Principles.
Problems.
Further Reading.
A Big Squeeze.
III. THE PRODUCT.
Column 11. Sorting.
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.