2. (10分) Run the merge sort on the following array: (5,1,8,3,6,4,7,2) step by step.

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

2. (10分) Run the merge sort on the following array: (5,1,8,3,6,4,7,2) step by step.

相關申論題

相關試卷