Assignment 2

This assignment focuses on Monoid and Foldable structures, focusing on a divide and conquer algorithm: mergesort.

You should download hw02.zip. This contains the template for the exercise - the standard stack/cabal boilerplate, a lib folder with two files (SortedList.hs and MergeSort.hs), plus an app folder that runs tests. Fill in SortedList.hs and MergeSort.hs, by following their instructions and submit a just these two files (i.e. just SortedList.hs and MergeSort.hs) through Gradescope.

As a reminder, you should take a look and follow the style guide.

The deadline for this is Friday, February 18th, 11:59 pm Eastern.