This video describes a recursive VB.NET implementation of a quicksort. It follows on from previous quicksort videos that covered algorithms for partitioning a list, and pseudocode for a program that calls itself recursively to process successively smaller partitions, until the original list is fully sorted. Three different versions of a function to partition a list and return the pivot value’s resting position are described, along with a recursive quicksort procedure that can make use of any one of these functions. This video also demonstrates how to step through the quicksort procedure, with a Visual Studio Watch window and the Call Stack window open, allowing you can observe the values of pointers and the pivot position changing as different invocations begin and end.