Merge Sort 2 – Towards an Implementation (Split a List)

This is the second in a series of videos about the merge sort. It includes a description of an algorithm and pseudocode for taking an unordered list and splitting it into two separate unordered lists. The videos that follow build on these principles, leading towards a recursive implementation of a merge sort in Visual Basic.NET.