Programming Pearls Programming Pearls

Programming Pearls

    • 5.0 • 1 Rating
    • $42.99
    • $42.99

Publisher Description

When programmers list their favorite books, Jon Bentley’s collection of programming pearls is commonly included among the classics. Just as natural pearls grow from grains of sand that irritate oysters, programming pearls have grown from real problems that have irritated real programmers. With origins beyond solid engineering, in the realm of insight and creativity, Bentley’s pearls offer unique and clever solutions to those nagging problems. Illustrated by programs designed as much for fun as for instruction, the book is filled with lucid and witty descriptions of practical programming techniques and fundamental design principles. It is not at all surprising that Programming Pearls has been so highly valued by programmers at every level of experience.

In this revision, the first in 14 years, Bentley has substantially updated his essays to reflect current programming methods and environments. In addition, there are three new essays on
testing, debugging, and timing set representations string problems
All the original programs have been rewritten, and an equal amount of new code has been generated. Implementations of all the programs, in C or C++, are now available on the Web.

What remains the same in this new edition is Bentley’s focus on the hard core of programming problems and his delivery of workable solutions to those problems. Whether you are new to Bentley’s classic or are revisiting his work for some fresh insight, the book is sure to make your own list of favorites.

GENRE
Computers & Internet
RELEASED
2016
April 21
LANGUAGE
EN
English
LENGTH
256
Pages
PUBLISHER
Pearson Education
SELLER
Pearson Education Inc.
SIZE
12.3
MB

Customer Reviews

liketofindout ,

One of the nicest books about programming

Two great chapters in the book: how to write and make sure it is a correct program for Binary Search, and how it is important to improve your program from O(n x n) to O(n log n) or O(n)… for finding out the maximum profit problem or the maximum subarray problem. It is really worth it. And it actually is a book worthy of sitting down and reading, a little bit like an adventure story.

Algorithms in a Nutshell Algorithms in a Nutshell
2008
The Beauty of Computation The Beauty of Computation
2013
Data Structures and Algorithm Analysis in Java, Third Edition Data Structures and Algorithm Analysis in Java, Third Edition
2012
The Algorithm Design Manual The Algorithm Design Manual
2009
Computer Science Programming Basics in Ruby Computer Science Programming Basics in Ruby
2013
Programming Problems: Advanced Algorithms Programming Problems: Advanced Algorithms
2013
The Elements of Computing Systems, second edition The Elements of Computing Systems, second edition
2021
Designing Data-Intensive Applications Designing Data-Intensive Applications
2017
So Good They Can't Ignore You So Good They Can't Ignore You
2012
Meditations Meditations
2002
Atomic Habits Atomic Habits
2018