algorithm - 将方法分类为图形的大 O 表示法

Question

我在理解大 O 符号和计算复杂性等方面遇到了很多麻烦。我认为我在 Internet 上找到的所有复杂数学都让我眼花缭乱。

我正在尝试绘制一个图表来表示插入排序和 shell 排序的效率。

我想我明白 shell 排序的最坏情况是 n^2，最好情况是 nlogn。这适用于所有 shell 类型吗？我如何在具有相关时间轴和 的图表中表示这一点？

非常感谢任何帮助，我很迷茫。

如果相关的话，这是我的 shell 排序代码。

int const size = 5;
int i, j, increment, temp;
int array[size]={4,5,2,3,6}, i1=0;
//split the array into segments between the elements unil we reach beginning of array    
for(increment = size/2;increment > 0; increment /= 2)
{
    //increment through elements in array for comparison starting point
    for(i = increment; i<size; i++)
    {
        //set temp to last element in array segment
        temp = array[i];
        //decrement index by size of gap
        for(j = i; j >= increment ;j-=increment)
        {
            //compare element with element gap length behind
            if(temp < array[j-increment])
            {
                //swap elements if less than gap element
                array[j] = array[j-increment];
            }
            else
            {
                //if not break from loop
                break;
            }
        }
        array[j] = temp;
    }
}

Answer 1

How do I represent this in a graph with the relevant axis of time and ? - N, the size of the input, is your independent variable and is represented in the horizontal axis (x) - Plot N^2 (the worst case) in the vertical axis (y) - Also plot NlogN (the best case) in the vertical axis (y)