售价: ¥435.00 待定配送费
此商品不能使用“一键下单”
前翻 后翻
正在播放... 已暂停   您正在聆听的 Audible 音频版本的样品。
了解更多信息
查看全部 3 张图片

Programming Pearls (2nd Edition) (英语) 平装 – 1999年10月7日

| 天天低价·正品质优
|
分享
广告

显示所有 格式和版本 隐藏其他格式和版本
亚马逊价格
全新品最低价 非全新品最低价
平装
¥435.00
¥435.00
 

click to open popover

无需Kindle设备,下载免费Kindle阅读软件,即可在您的手机、电脑及平板电脑上畅享阅读。

  • iPhone/iPad/Mac
  • Android手机或平板电脑

请输入您的手机号码,获取Kindle阅读软件的下载链接。



基本信息

  • 出版社: Addison-Wesley Professional; 2 (1999年10月7日)
  • 丛书名: ACM Press
  • 平装: 256页
  • 语种: 英语
  • ISBN: 0201657880
  • 条形码: 0785342657883, 9780201657883
  • 商品尺寸: 15.7 x 1.8 x 23.4 cm
  • 商品重量: 363 g
  • ASIN: 0201657880
  • 用户评分: 分享我的评价
  • 亚马逊热销商品排名: 图书商品里排第1,471,934名 (查看图书商品销售排行榜)
  • 您想告诉我们您发现了更低的价格?

商品描述

作者简介

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.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.

目录

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.

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. 0201657880T04062001


无顾客评论


评论该商品

与其他买家分享您的想法

此商品在美国亚马逊上最有用的商品评论

美国亚马逊: 4.3 颗星,最多 5 颗星 90 条评论
Darren Wang
4.0 颗星,最多 5 颗星Great for familiarizing coding state of mind, an interesting complement to algorithm and coding interview books
2016年1月10日 - 已在美国亚马逊上发表
已确认购买
8 个人发现此评论有用.
kost
4.0 颗星,最多 5 颗星I got a poor quality edition
2018年8月30日 - 已在美国亚马逊上发表
已确认购买
3 个人发现此评论有用.
Roger Merritt
5.0 颗星,最多 5 颗星I was glad to get this gem again
2014年1月16日 - 已在美国亚马逊上发表
已确认购买
3 个人发现此评论有用.
Christopher M. Goebel
5.0 颗星,最多 5 颗星I like this book a lot.
2018年10月10日 - 已在美国亚马逊上发表
已确认购买
a reader
4.0 颗星,最多 5 颗星Makes you think harder
2004年8月20日 - 已在美国亚马逊上发表
已确认购买
24 个人发现此评论有用.