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
  • 無法訂購

買這商品的人也買了...

相關主題

商品描述


Table Of Contents

1. Introduction.
Algorithms.
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.

3. The Efficiency of Functional Programs.
Reduction Order.
Analyzing the Efficiency of Programs.
Program Transformation.
Conclusion.
Exercises.
Bibliographical Notes.

4. Concrete Data Types.
Lists.
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.

6. Sorting.
Introduction.
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.

8. Top-down Design Techniques.
Divide-and-conquer.
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.

10. Advanced topics.
Process Network.
Monads.
Parallel Algorithms.
Bibliographical Notes.

Bibliography.
A: Haskell Implementations.
B: Mathematical Background.
Notation.
Logarithms.
Summation Formulas.
Solving Recurrence Equations.

Index. 0201596040T04062001


Back to Top