第 1/1 張圖片
第 1/1 張圖片
Introduction to Algorithms, Second Edition by Cormen, Thomas H|Leiserson, Cha…
US $21.90
大約HK$ 170.47
狀況：
“Satisfaction Guaranteed! 100% Money Back Guarantee.Book is in typical used-Good Condition. Will show ”... 閱讀更多內容關於物品狀況
良好
曾被閱讀過的書籍，但狀況良好。封面有諸如磨痕等在內的極少損壞，但沒有穿孔或破損。精裝本書籍可能沒有書皮。封皮稍有磨損。絕大多數書頁未受損，存在極少的褶皺和破損。使用鉛筆標注文字處極少，未對文字標記，無留白處書寫文字。沒有缺頁。
運費：
US $3.97（大約 HK$ 30.90） Economy Shipping.
所在地：Multiple Locations, 美國
送達日期：
估計於 9月30日, 一至 10月4日, 五之間送達 運送地點 43230
退貨：
30 日退貨. 由賣家支付退貨運費.
保障：
請參閱物品說明或聯絡賣家以取得詳細資料。閱覽全部詳情查看保障詳情
（不符合「eBay 買家保障方案」資格）
安心購物
物品細節
- 物品狀況
- 良好
- 賣家備註
- ISBN
- 9780070131514
- Subject Area
- Mathematics, Computers
- Publication Name
- Introduction to Algorithms
- Publisher
- McGraw-Hill Higher Education
- Item Length
- 9.3 in
- Subject
- Programming / Algorithms, Algebra / General
- Publication Year
- 2001
- Type
- Textbook
- Format
- Hardcover
- Language
- English
- Item Height
- 2.3 in
- Item Weight
- 83.4 Oz
- Item Width
- 8.2 in
- Number of Pages
- 1056 Pages
關於產品
Product Identifiers
Publisher
McGraw-Hill Higher Education
ISBN-10
0070131511
ISBN-13
9780070131514
eBay Product ID (ePID)
30505
Product Key Features
Number of Pages
1056 Pages
Publication Name
Introduction to Algorithms
Language
English
Subject
Programming / Algorithms, Algebra / General
Publication Year
2001
Type
Textbook
Subject Area
Mathematics, Computers
Format
Hardcover
Dimensions
Item Height
2.3 in
Item Weight
83.4 Oz
Item Length
9.3 in
Item Width
8.2 in
Additional Product Features
Edition Number
2
Intended Audience
College Audience
LCCN
2001-031277
Dewey Edition
22
Illustrated
Yes
Dewey Decimal
005.1
Table Of Content
Preface I Foundations 1 The Role of Algorithms in Computing 2 Getting Started 3 Growth of Functions 4 Recurrences 5 Probabilistic Analysis and Randomized Algorithms II Sorting and Order Statistics 6 Heapsort 7 Quicksort 8 Sorting in Linear Time 9 Medians and Order Statistics III Data Structures 10 Elementary Data Structures 11 Hash Table 12 Binary Search Trees 13 Red-Black Trees 14 Augmenting Data Structures IV Advanced Design and Analysis Techniques 15 Dynamic Programming 16 Greedy Algorithms 17 Amortized Analysis V Advanced Data Structures 18 B-Trees 19 Binomial Heaps 20 Fibonacci Heaps 21 Data Structures for Disjoint Sets VI Graph Algorithms 22 Elementary Graph Algorithms 23 Minimum Spanning Trees 24 Single-Source Shortest Paths 25 All-Pairs Shortest Paths 26 Maximum Flow VII Selected Topics 27 Sorting Networks 28 Matrix Operations 29 Linear Programming 30 Polynomials and the FFT 31 Number-Theoretic Algorithms 32 String Matching 33 Computational Geometry 34 NP-Completeness 35 Approximation Algorithms VIII Appendix: Mathematical Background A Summations B Sets, Etc. C Counting and Probability Bibliography Index (created by the authors)
Synopsis
The updated new edition of the classic Introduction to Algorithms is intended primarily for use in undergraduate or graduate courses in algorithms or data structures. Like the first edition, this text can also be used for self-study by technical professionals since it discusses engineering issues in algorithm design as well as the mathematical aspects. In its new edition, Introduction to Algorithms continues to provide a comprehensive introduction to the modern study of algorithms. The revision has been updated to reflect changes in the years since the book's original publication. New chapters on the role of algorithms in computing and on probabilistic analysis and randomized algorithms have been included. Sections throughout the book have been rewritten for increased clarity, and material has been added wherever a fuller explanation has seemed useful or new information warrants expanded coverage. As in the classic first edition, this new edition of Introduction to Algorithms presents a rich variety of algorithms and covers them in considerable depth while making their design and analysis accessible to all levels of readers. Further, the algorithms are presented in pseudocode to make the book easily accessible to students from all programming language backgrounds. Each chapter presents an algorithm, a design technique, an application area, or a related topic. The chapters are not dependent on one another, so the instructor can organize his or her use of the book in the way that best suits the course's needs. Additionally, the new edition offers a 25% increase over the first edition in the number of problems, giving the book 155 problems and over 900 exercises that reinforcethe concepts the students are learning.
LC Classification Number
QA76.6
賣家提供的物品說明
賣家信用評價 （4,277）
- o***i (293)- 買家留下的信用評價。過去 1 個月購買已獲認證Just as described.
- a***0 (70)- 買家留下的信用評價。過去 1 個月購買已獲認證The book came in exactly like the picture. Excellent.
- b***a (483)- 買家留下的信用評價。過去 1 個月購買已獲認證Good begginers guide but not up to date as far as materials.