InsertionSort-Analizado

InsertionSort-Analizado.cs

public void InsertionSort(List<Int32> elements, Boolean ascending = true)
{                                                          //CUSTO EXECUÇÕES
    for (Int32 j = 1; j < elements.Count; j++)             //c1    n
    {                                                         
        Int32 key = elements[j];                           //c2    n - 1
        Int32 i = j - 1;                                   //c3    n - 1
                                                              
        while (i >= 0 && (elements[i] > key) == ascending) //c4    somatorio[j = 1 -> n] tj
        {
            elements[i + 1] = elements[i];                 //c5    somatorio[j = 1 -> n] tj - 1
            i--;                                           //c6    somatorio[j = 1 -> n] tj - 1
        }

        elements[i + 1] = key;                             //c7    n - 1
    }
}