In this project we implemented different sequential sorting algorithms in haskells functional paradigm.
- QuickSort
- MergeSort
- BitonicSort
We then continued to create the parallel counterparts of these algorithms. Finally, we implemented a Hybrid sort which is a combination of the best features of the other sorts we implemented.
The paper can be viewed: At the following Link