Fundamentals of Algorithmics
Gilles Brassard, Paul Bratley
- 出版商: Prentice Hall
- 出版日期: 1995-08-20
- 售價: $931
- 語言: 英文
- 頁數: 524
- 裝訂: Hardcover
- ISBN: 0133350681
- ISBN-13: 9780133350685
-
相關分類:
Algorithms-data-structures
已絕版
買這商品的人也買了...
-
Computer Organization & Design: The Hardware/Software Interface, 2/e$1,200$1,176 -
計算機組織與設計--軟硬體界面第二版 (Computer Organization & Design, 2/e)$680$537 -
Advanced Concepts In Operating Systems$930$911 -
Data Mining: Concepts and Techniques$2,610$2,480 -
$960Software Engineering: A Practitioner's Approach, 5/e -
$1,029Operating Systems: Internals and Design Principles, 4/e -
Modern Operating Systems, 2/e (IE) (美國版ISBN:0130313580)$1,030$1,009 -
$1,045Java How to Program, 4/e -
$970Introduction to Algorithms, 2/e -
Digital Image Processing, 2/e(IE)(美國版ISBN:0201180758)$1,150$1,127 -
Juniper Networks Routers: The Complete Reference$2,520$2,394 -
$1,274Computer Architecture: A Quantitative Approach, 3/e(精裝本) -
$1,029Operating System Concepts, 6/e (Windows XP Update) -
Cryptography and Network Security Principles and Practices, 3/e$1,030$1,009 -
Understanding the Linux Kernel, 2/e (Paperback)$1,860$1,767 -
Sun Certified Programmer & Developer for Java 2 Study Guide, 2/e$1,890$1,796 -
PHP & MySQL 完全架站攻略第二版$620$558 -
Red Hat Linux 9 實務應用$650$553 -
ASP.NET 程式設計徹底研究$590$466 -
STRUTS 實作手冊(Struts in Action: Building Web Applications with the Leading Java Framework)$690$538 -
CCNA Self-Study: Interconnecting Cisco Network Devices (ICND) 640-811, 640-801, 2/e$2,340$2,223 -
Microsoft PowerPoint 2003 使用手冊$450$383 -
Microsoft Word 2003 使用手冊$490$417 -
$1,986Code Complete: A Practical Handbook of Software Construction, 2/e (Paperback) -
Word 排版藝術$620$490
相關主題
商品描述
Description:
For departments of computer science offering Sophomore through Junior-level courses in Algorithms or Design and Analysis of Algorithms.
This is an introductory-level algorithm text. It includes worked-out examples and detailed proofs. Presents Algorithms by type rather than application.
Table of Contents:
1. Preliminaries.
2. Elementary
Algorithmicss.
3. Asymptotic Notation.
4.
Analysis of Algorithms.
5. Some Data
Structures.
6. Greedy Algorithms.
7.
Divide-And-Conquer.
8. Dynamic
Programming.
9. Exploring Graphs.
10. Probabilistic
Algorithms.
11. Parallel Algorithms.
12. Computational
Complexity.
13. Heuristic and Approximate Algorithms.
References.
Index.
