Sorting

An exploration of different sorting algorithm implementations in Haskell. This repo focuses on 3 main areas:

1. Demostrating "in-place" sorts using the MArray interface.
2. Comparing the required Haskell code with a more imperative language (Python).
3. Demonstrating basics of benchmarking and profiling code.

Planned Algorithms

1. Quicksort
2. Merge Sort
3. Heap Sort
4. Insertion Sort
5. Selection Sort
6. Bubble Sort