Http://wiki.ubc.ca/Course:CPSC312-2017-Functional-data-structures-and-algorithms

From UBC Wiki

Functional data structures and algorithms

Authors: Imelda S, Rachel Z, Josh Z

Source Code

What is the problem?

In CPSC 221, we learn various sorting algorithms and data structures in C++, such as queues, stacks, heaps, and BST/AVL trees. We would like to explore how to implement these algorithms and data structures in Haskell and how it differs from those implemented in a object-orientated language like C++.

What is the something extra?

Most algorithms and data structures we learn about in class assume imperative programming. We will explore the idea of purely functional data structures (immutable) and implement a few to compare it with our other data structures.

What did we learn from doing this?