I have written some codes on formalizing different variations of divide-and-conquer algorithm design paradigm for lists. As a case study, we will see how these different variations lead to different sorting algorithms. The github page for the codes are as follows:
I am still in the midst of providing desciption for each of the files. It would be great if any of you all could provide some feedbacks so that I can improve and expand on my work. Thank you.