渐进时间复杂度即时间复杂度

void TimeCalculation(int Array_A[n][n],int Array_B[n][n],int Array_C[n][n])

{

int i,j,k;

for(i = 0; i< n;i++)                                                 //statement 1

   for(j = 0 ;j < n; j++)                                           //statement  2

{

Array_C[i][j] = 0;                                                   //statement 3

for(k = 0;k<n;k++)                                               //statement 4

Array_C[i][j] = Array_C[i][j]+Array_A[i][k];          //statement 5

}

}

statement 1~statement 5的执行次数分别为n+1,n(n+1),n^2,(n+1)n^2,n^3,算法时间复杂度：

T(n) = 2*n^3+3*n^2+2*n+1

当问题的规模n趋向无穷大时等于2

lim[T(n)/n^3] = 2

所以，T(n)= O(n^3)