Question

?Q5. [10 marks] Implement a function SUM(Stack S) in pseudocode to add up all elements of stack S. In the end of your algorithm, the stack S becomes empty. Denoting the size of stack S by $|S|$, give the time complexity of your algorithm. In this question, only the operations defined in Stack ADT as shown in Fig. 2 are allowed. For example, for(i=0; i<n; i++) ans+=a[i] is a wrong algorithm, since visiting an arbitrary element by index is not a valid stack operation. Instead, you can only touch the top element of an stack by Pop or Top. When S? and S? in Fig. 1 are fed to your algorithm, SUM(S?) and SUM(S?) should return 14 and 8 respectively. 1 3 4 6 4 3 1 S? S? Fig. 1. Two Demo Stacks

          ?Q5. [10 marks] Implement a function SUM(Stack S) in pseudocode to add up all elements
of stack S. In the end of your algorithm, the stack S becomes empty. Denoting the size
of stack S by $|S|$, give the time complexity of your algorithm.
In this question, only the operations defined in Stack ADT as shown in Fig. 2 are allowed.
For example, for(i=0; i<n; i++) ans+=a[i] is a wrong algorithm, since visiting an arbitrary
element by index is not a valid stack operation. Instead, you can only touch the top
element of an stack by Pop or Top.
When S? and S? in Fig. 1 are fed to your algorithm, SUM(S?) and SUM(S?) should return
14 and 8 respectively.
1
3
4
6
4
3
1
S?
S?
Fig. 1. Two Demo Stacks

?Q5. [10 marks] Implement a function SUM(Stack S) in pseudocode to add up all elements
of stack S. In the end of your algorithm, the stack S becomes empty. Denoting the size
of stack S by |S|, give the time complexity of your algorithm.
In this question, only the operations defined in Stack ADT as shown in Fig. 2 are allowed.
For example, for(i=0; i<n; i++) ans+=a[i] is a wrong algorithm, since visiting an arbitrary
element by index is not a valid stack operation. Instead, you can only touch the top
element of an stack by Pop or Top.
When S? and S? in Fig. 1 are fed to your algorithm, SUM(S?) and SUM(S?) should return
14 and 8 respectively.
1
3
4
6
4
3
1
S?
S?
Fig. 1. Two Demo Stacks

Added by Tracy C.

Question

Please give Ace some feedback