8.(10分)Give an asymptotic upper bound for T(n) = 7T( n / 3 ) + n^2 where T(n) is constant for n &lt; 3. Your upper bound should be as tight as possible.

7. 使用 linked list 實作 stack，運用以下 C 語言程式：typedef struct node { int value; node *next;}void push (node **top, int new_value) { // assume top is not nullnode new_node = (node ) malloc (sizeof (node));// (A) 實作以下敘述 (5 分)// add new_node to stack by top}int pop (node **top) { // assume top is not nullint value;node deleting_node = top;// (B) 實作以下敘述(5 分)// remove the deleting node from stack, get the value of deleting nodefree(deleting_node);return value;}

8.(10分)Give an asymptotic upper bound for \( \mathrm{T(n)} = 7\mathrm{T}\left(\lfloor \mathrm{n} / 3\rfloor \right) + \mathrm{n}^2 \) where \( \mathrm{T(n)} \) is constant for \( \mathfrak{n} < 3 \). Your upper bound should be as tight as possible.

相關申論題

相關試卷