Question

Write an algorithm in pseudocode or english that would describe how to use a stack to reverse any list.

Answer 1

int data[n];
int rev[n];

for (i=0; i < n; i++)
     stack.push(data[n]);
for (i=0; i <n; i++)
     rev[i] = stack.pop();