5. (10%) Solve the recurrence relation a_n = a_n - 1 + 2n + 3 where a_0 = 5.

3.(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 stackfree(deleting_node);return value;}

5. (10%) Solve the recurrence relation \( a_{n} = a_{n - 1} + 2n + 3 \) where \( a_0 = 5 \).

相關申論題

相關試卷