数据结构习题答汇案总.docVIP

数据结构课后习题参考答案 1.20 （1）T(n) = n-1；渐近时间复杂度为O(n)。 （2）T(n) = élog2nù；渐近时间复杂度为O(log2n)。 （3）T(n) = n(n+1)(n+2)/6；渐近时间复杂度为O(n3) （4）T(n) =；渐近时间复杂度为O() 2.3 template class T bool SeqListT::Insert2(int i, T x) { if (i -1 || i n-1) { cout Out of bounds endl; return false; } if (n == maxLength) { T *elem = new T[2 * maxLength]; maxLength = maxLength * 2; for (int j = 0; j = i; j++) elem[j] = elements[j]; elem[i+1] = x; for (j = i+1; j n; j++) elem[j+1] = elements[j]; n++; delete []elements; elements = elem; return true; } for (int j = n-1; j i; j--