中圖網小程序
一鍵登錄
更方便
本類五星書更多>
-
>
全國計算機等級考試最新真考題庫模擬考場及詳解·二級MSOffice高級應用
-
>
決戰行測5000題(言語理解與表達)
-
>
軟件性能測試.分析與調優實踐之路
-
>
第一行代碼Android
-
>
JAVA持續交付
-
>
EXCEL最強教科書(完全版)(全彩印刷)
-
>
深度學習
編程珠璣-(英文版.第2版) 版權信息
- ISBN：9787115232601
- 條形碼：9787115232601 ; 978-7-115-23260-1
- 裝幀：一般膠版紙
- 冊數：暫無
- 重量：暫無
- 所屬分類：>>
編程珠璣-(英文版.第2版) 本書特色
多年以來。當程序員們推選出心愛的計算機圖書時，《編程珠璣》總是位于前列。正如自然界里珍珠出自細沙對牡蠣的磨礪.計算機科學大師Jon Bentley以其獨有的洞察力和創造力，從磨礪程序員的實際問題中凝結出一篇篇不朽的編程“珠璣”。這些文章是《ACM通訊》受歡迎的專欄文章，*終結集為兩部書出版。《編程珠璣（英文版·第2版）》為**卷。主要討論計算機科學中本質的問題：如何正確選擇和高效地實現算法。 在書中，作者選取許多具有典型意義的復雜編程和算法問題。生動描繪了歷史上眾多大師們在探索解決方案中發生的軼事、走過的彎路和不斷精益求精的歷程。引導讀者開展創新性的思考。書中透徹闡述和總結了許多獨特而精妙的設計原則、思考和解決問題的方法以及實用程序設計技巧。解決方案的代碼均以C／C++語言編寫，不僅有趣。而且有很大的實戰示范意義。每章后所附習題極具挑戰性和啟發性，書末給出了簡潔的解答。 “《編程珠璣》第1版是對我職業生涯早期影響很大的一本書。其中的許多真知灼見多年之后仍然使我受益匪淺。Jon在第2版中對素材進行了大量更新。許多新內容讓我耳目一新。” ——Steve McConnell，《代碼大全》作者 “對每一位遇到的程序員，我都會毫不遲疑地建議他閱讀并不斷重讀這部經典之作。” &n
編程珠璣-(英文版.第2版) 內容簡介
本書是計算機科學方面的經典名著。書的內容圍繞程序設計人員面對的一系列實際問題展開。作者jon bentley以其獨有的洞察力和創造力，引導讀者理解這些問題并學會解決方法，而這些正是程序員實際編程生涯中至關重要的。本書的特色是通過一些精心設計的有趣而又頗具指導意義的程序，對實用程序設計技巧及基本設計原則進行了透徹而睿智的描述，為復雜的編程問題提供了清晰而完備的解決思路。本書對各個層次的程序員都具有很高的閱讀價值。
編程珠璣-(英文版.第2版) 目錄
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
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
展開全部
編程珠璣-(英文版.第2版) 作者簡介
本特利，Jon Bentley，1953年2月20日出生于美國加州長灘。1974年畢業于斯坦福大學數學系，1976年獲北卡羅來納大學博士學位。他先后任職于卡內基-梅隆大學（1976-1982）、貝爾實驗室（1982-2001）和Avaya實驗室（2001年至今）。在卡內基-梅隆大學任教期間。他培養了許多后來知名的計算機大家。包括Scribe的開發者Brian Reid，Tcl語言設計者John Ousterhout，Java專家Joshua Bloch，Java語言設計者James Gosling，《算法導論》作者之——Charles Leiserson。2004年榮獲Dr. Dobb's程序設計卓越獎。
書友推薦
- >
詩經-先民的歌唱
- >
我從未如此眷戀人間
- >
自卑與超越
- >
月亮虎
- >
羅曼·羅蘭讀書隨筆-精裝
- >
二體千字文
- >
朝聞道
- >
【精裝繪本】畫給孩子的中國神話
本類暢銷
