注冊 | 登錄讀書好,好讀書,讀好書!
讀書網(wǎng)-DuShu.com
當前位置: 首頁出版圖書科學技術計算機/網(wǎng)絡軟件與程序設計其他編程語言/工具編程珠璣(英文版·第2版)

編程珠璣(英文版·第2版)

編程珠璣(英文版·第2版)

定 價:¥39.00

作 者: (美)本特利 著
出版社: 人民郵電出版社
叢編項: 圖靈程序設計叢書
標 簽: 程序設計

ISBN: 9787115232601 出版時間: 2010-08-01 包裝: 平裝
開本: 16開 頁數(shù): 239 字數(shù):  

內容簡介

  《編程珠璣(英文版·第2版)》是計算機科學方面的經典名著。書的內容圍繞程序設計人員面對的一系列實際問題展開。作者Jon Bentley以其獨有的洞察力和創(chuàng)造力,引導讀者理解這些問題并學會解決方法,而這些正是程序員實際編程生涯中至關重要的。《編程珠璣(英文版·第2版)》的特色是通過一些精心設計的有趣而又頗具指導意義的程序,對實用程序設計技巧及基本設計原則進行了透徹而睿智的描述,為復雜的編程問題提供了清晰而完備的解決思路。《編程珠璣(英文版·第2版)》對各個層次的程序員都具有很高的閱讀價值。計算機科學的不朽經典,融深邃思想、實戰(zhàn)技術與趣味軼事于一爐的奇書,字字珠璣,意味雋永。

作者簡介

  本特利,Jon Bentley,1953年2月20日出生于美國加州長灘。1974年畢業(yè)于斯坦福大學數(shù)學系,1976年獲北卡羅來納大學博士學位。他先后任職于卡內基-梅隆大學(1976-1982)、貝爾實驗室(1982-2001)和Avaya實驗室(2001年至今)。在卡內基-梅隆大學任教期間。他培養(yǎng)了許多后來知名的計算機大家。包括Scribe的開發(fā)者Brian Reid,Tcl語言設計者John Ousterhout,Java專家Joshua Bloch,Java語言設計者James Gosling,《算法導論》作者之——Charles Leiserson。2004年榮獲Dr. Dobb’s程序設計卓越獎。

圖書目錄

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

本目錄推薦

掃描二維碼
Copyright ? 讀書網(wǎng) www.afriseller.com 2005-2020, All Rights Reserved.
鄂ICP備15019699號 鄂公網(wǎng)安備 42010302001612號