InsertionSorter.cs

usingSystem.Collections.Generic;
usingDataStructures.Lists;

namespaceAlgorithms.Sorting
{
/// <summary>
/// Implements this Insertion Sort algorithm over ArrayLists.
/// </summary>
publicstaticclassInsertionSorter
{
//
// The quick insertion sort algorithm.
// For any collection that implements the IList interface.
publicstaticvoidInsertionSort<T>(thisIList<T>list,Comparer<T>comparer=null)
{
//
// If the comparer is Null, then initialize it using a default typed comparer
comparer=comparer??Comparer<T>.Default;

// Do sorting if list is not empty.
inti,j;
for(i=1;i<list.Count;i++)
{
Tvalue=list[i];
j=i-1;

while((j>=0)&&(comparer.Compare(list[j],value)>0))
{
list[j+1]=list[j];
j--;
}

list[j+1]=value;
}
}


//
// The quick insertion sort algorithm.
// For the internal ArrayList<T>. Check the DataStructures.ArrayList.cs.
publicstaticvoidInsertionSort<T>(thisArrayList<T>list,Comparer<T>comparer=null)
{
//
// If the comparer is Null, then initialize it using a default typed comparer
comparer=comparer??Comparer<T>.Default;

for(inti=1;i<list.Count;i++)
{
for(intj=i;j>0;j--)
{
if(comparer.Compare(list[j],list[j-1])<0)//(j)th is less than (j-1)th
{
vartemp=list[j-1];
list[j-1]=list[j];
list[j]=temp;
}
}
}
}

}

}