This week’s prep introduces an entirely new application of recursion: recursive sorting algorithms. We’ll study two particularly famous recursive sorting algorithms, and in next week’s lectures, compare their running time to traditional iterative sorting algorithms like insertion sort or selection sort.
Complete the Prep 10 quiz: Recursive Sorting Algorithms quiz on Quercus.
This week’s programming exercises are about taking the given implementations of mergesort and quicksort and extending them in some interesting ways. Please find our detailed instructions in the starter code.
Note: while we’ve provided some doctests, we haven’t provided any additional sample tests this week. However, we strongly encourage you add your own tests to verify that your code is correct!
When you’re done, submit prep10.py on MarkUs.