MAC 3024 Algorithms in Haskell
Functional programs tend to be shorter, clearer and faster to develop than their imperative counterparts. This contributes to a better understanding of the algorithm being implemented and makes it possible to explore alternative solutions more rapidly. This module covers traditional topics in sorting, searching, graph algorithms, as well as algorithm design strategies: divide-and-conquer and dynamic programming. The emphasis is on intuitive and pragmatic program development techniques. Pre-requisite: Intro to FPL using Haskell (MAC 3021)