static void InsertionSort()
{
var unsortedList = new SortingList(10);
var sortedList = new SortingList(unsortedList.Length);
/* Let's fill the unsorted list with all sorts of junk */
unsortedList.Randomise();
unsortedList.Print();
/* This is where we do the insertion sort-- doesn't
* object oriented make this look easy? */
for (int i = 0; i < unsortedList.Length; i++)
{
sortedList.Insert(unsortedList.Pop());
}
sortedList.Print();
}