这两种算法是否具有相同的 Θ(n^2) θ 表征?
int sum = 0;
for (int i = 0; i < n; i++ )
for (int j = 0; j < n * n; j++ )
sum++;
int sum = 0;
for ( int i = 0; i < n; i++)
for ( int j = 0; j < i; j++)
sum++;
如果不是,那么这是否意味着这种表征不是 Θ(n^3)?
int sum = 0;
for ( int i = 0; i < n; i++)
for ( int j = 0; j < i * i; j++ )
for ( int k = 0; k < j; k++ )
sum++;