3. (10分) Give an asymptotic upper bound for the function T(n) where T(n) satisfies the recurrent equation T(n) = 3T( n / 4 ) + n^2 for integer n &gt; 2 and T(2) is a constant.

6. (10 分) 使用 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));// 實作以下敘述// add new_node to stack by top}int pop (node **top) { // assume top is not nullint value;node deleting_node = top;// 實作以下敘述// remove the deleting node from stack, get the value of deleting nodefree(deleting_node);return value;}

3. (10分) Give an asymptotic upper bound for the function \( T(n) \) where \( T(n) \) satisfies the recurrent equation \( T(n) = 3T(\lfloor n / 4 \rfloor) + n^2 \) for integer \( n > 2 \) and \( T(2) \) is a constant.

相關申論題

相關試卷