Quicksort 4 – VB.NET Implementation

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.

[jtlunsford]

Loved it. Accidentally left the "i" off "iLeft" at the top of Function Partition2 and found it moved the Form. That was a cool discovery, so I used Left and Top to move the Form away from my MsgBox. How handy is that....anyway, thank you so much for the code explanation, it brought things together for me...JT

[Alejazambrano]

Wondering if you could make a video of how to add an MS Access database 2016 to vb ? Would appreciate this, as im currently not able to do so. I am trying to make a room booking system, any help would be nice. Currently making use of your Cinema Seat Booking System. Thanks