Algorithms: a Functional Programming Approach
Fethi A. Rabhi, Guy Lapalme
- 出版商: Addison Wesley
- 出版日期: 1999-06-01
- 售價: $950
- 貴賓價: 9.8 折 $931
- 語言: 英文
- 頁數: 256
- 裝訂: Paperback
- ISBN: 0201596040
- ISBN-13: 9780201596045
-
相關分類:
Algorithms-data-structures
無法訂購
買這商品的人也買了...
-
Inside the C++ Object Model (Paperback)$2,510$2,385 -
Object-Oriented Methods: A Foundation$570$559 -
Purely Functional Data Structures (1ST ed.)(快遞進口)$2,480$2,356 -
Essential C++ (Paperback)$2,010$1,910 -
Exceptional C++: 47 Engineering Puzzles, Programming Problems, and Exception-Saf$2,170$2,062 -
Programming Ruby: A Pragmatic Programmer's Guide (Paperback)$1,840$1,748 -
Effective STL: 50 Specific Ways to Improve Your Use of the Standard Template Library (Paperback)$2,170$2,062 -
$970Introduction to Algorithms, 2/e -
More Exceptional C++ (Paperback)$1,723$1,637 -
XML 程式設計藝術 (XML How to Program)$950$855 -
ASP.NET 網頁製作教本─從基本語法學起$600$510 -
演算法導論 (Introduction to Algorithms, 2/e)$860$731 -
Specifying Systems: The TLA+ Language and Tools for Hardware and Software Engine$1,840$1,748 -
ASP.NET 程式設計徹底研究$590$466 -
C# Primer Plus 中文版 (C# Primer Plus)$680$537 -
鳥哥的 Linux 私房菜－伺服器架設篇$750$675 -
鳥哥的 Linux 私房菜─基礎學習篇增訂版$560$504 -
JSP 動態網頁入門實務$720$569 -
人月神話：軟體專案管理之道 (20 週年紀念版)(The Mythical Man-Month: Essays on Software Engineering, Anniversary Edition, 2/e)$480$379 -
JSP 2.0 技術手冊$750$593 -
建構嵌入式 Linux 系統$780$616 -
Word 排版藝術$620$490 -
Internet TCP/IP 協定觀念與實作, 2/e
$580$493 -
Embedded Linux Primer: A Practical Real-World Approach (Paperback)$2,010$1,910 -
Computer Algorithms, 2/e (Paperback)$1,390$1,362
相關主題
商品描述
Table Of Contents
1. Introduction. Algorithms.
Functional Languages.
Bibliographical Notes.
Functional Languages.
Bibliographical Notes.
2. Functional Programming in Haskell.
About the Language.
Equations and Functions.
Basic Types and Constructed Types.
Lists.
Higher-order Functional Programming Techniques.
Algebraic Types and Polymorphism.
Arrays.
Type Classes and Class Methods.
Exercises.
Bibliographical Notes.
Equations and Functions.
Basic Types and Constructed Types.
Lists.
Higher-order Functional Programming Techniques.
Algebraic Types and Polymorphism.
Arrays.
Type Classes and Class Methods.
Exercises.
Bibliographical Notes.
3. The Efficiency of Functional Programs.
Reduction Order.
Analyzing the Efficiency of Programs.
Program Transformation.
Conclusion.
Exercises.
Bibliographical Notes.
Analyzing the Efficiency of Programs.
Program Transformation.
Conclusion.
Exercises.
Bibliographical Notes.
4. Concrete Data Types.
Lists.
Trees.
Arrays.
Exercises.
Bibliographical Notes.
Trees.
Arrays.
Exercises.
Bibliographical Notes.
5. Abstract Data Types.
Introduction.
Stacks.
Queues.
Priority Queues.
Sets.
Tables.
Binary Search Trees.
Heaps.
AVL trees.
Exercises.
Bibliographical Notes.
Stacks.
Queues.
Priority Queues.
Sets.
Tables.
Binary Search Trees.
Heaps.
AVL trees.
Exercises.
Bibliographical Notes.
6. Sorting.
Introduction.
Comparison-based Sorting.
Basic Sorting Algorithms.
Tree-based Sorting.
Efficiency of Comparison-based Algorithms.
Representation-based Sorting.
Exercises.
Bibliographical Notes.
Comparison-based Sorting.
Basic Sorting Algorithms.
Tree-based Sorting.
Efficiency of Comparison-based Algorithms.
Representation-based Sorting.
Exercises.
Bibliographical Notes.
7. Graph Algorithms.
Definitions and Terminology.
The Graph ADT.
Depth-first and Breadth-first Search.
Topological Sort.
Minimum Spanning Tree.
Depth-first Search Trees and Forests.
Conclusion.
Exercises.
Bibliographical Notes.
The Graph ADT.
Depth-first and Breadth-first Search.
Topological Sort.
Minimum Spanning Tree.
Depth-first Search Trees and Forests.
Conclusion.
Exercises.
Bibliographical Notes.
8. Top-down Design Techniques.
Divide-and-conquer.
Backtracking Search.
Priority-first Search.
Greedy Algorithms.
Exercises.
Bibliographical Notes.
Backtracking Search.
Priority-first Search.
Greedy Algorithms.
Exercises.
Bibliographical Notes.
9. Dynamic Programming.
Introduction.
The Dynamic Programming Higher-order Function.
Chained Matrix Multiplications.
Optimal Binary Search Trees.
All-pairs Shortest Path.
The Travelling Salesperson.
Conclusion.
Exercises.
Bibliographical Notes.
The Dynamic Programming Higher-order Function.
Chained Matrix Multiplications.
Optimal Binary Search Trees.
All-pairs Shortest Path.
The Travelling Salesperson.
Conclusion.
Exercises.
Bibliographical Notes.
10. Advanced topics.
Process Network.
Monads.
Parallel Algorithms.
Bibliographical Notes.
Monads.
Parallel Algorithms.
Bibliographical Notes.
Bibliography.
A: Haskell Implementations.
B: Mathematical Background.
Notation.
Logarithms.
Summation Formulas.
Solving Recurrence Equations.
B: Mathematical Background.
Notation.
Logarithms.
Summation Formulas.
Solving Recurrence Equations.
Index. 0201596040T04062001
