数据结构-绪论

1.数据结构

2.时间复杂度

例1.
                                                                                        语句频度
for( int i=1;i<=2n;i++)
{
        y=y+1;                                                                         n-1
        for( int j=0;j<=2n;j++)
        {        x++;        }                                                         （n-1）(2n+1)
}

T(n)=n-1+(n-1)(2n+1)=O(n²)不用在乎其系数和加减




例2.                                                                           频度
int i=1;                                                                         1
while(i<=n)
{
i=i $\ast$ 2;                                                                             x
}
设算法执行x次，则有2^x≤n,即x≤log₂ⁿ所以i=i*2的频度为log₂ⁿ




例3.
int x=.0;
for(int i=0;i<=n;i++)
        for(int j=i+1;j<=n;j++)
                x++;


${\sum }_{i=0}^n{\sum }_{j=i+1}^n$=${\sum }_{i=1}^n$(n-1)
                         =(n-1)(n-2)+…+1
                         =$\frac{n(n-1)}{2}$

T(n)=O(n²)