Reading

Videos and slides

Check out Sorting example code.zip for versions of merge sort and quicksort that print out what they are doing (to help visualize the recursion structure).

Note: There are many partitioning schemes for quicksort. Each gives a diferent version of quicksort. This course uses a version of the Hoare partitioning scheme. You may be familiar with a different version. For the exam, you only have to know one partition scheme, and it doesn't matter which one. But you need to write which one you use so that we can grade accordingly.

Note: The website VisuAlgo from the previous lecture page uses a different version of the partitioning algorithm than we do. If you want to see a visualisation of our version, try Data Structure Visualizations instead.