Which one of the following permutations can be obtained the output using stack assuming that the input is the sequence 1,2,3,4,5 in that order ?
Answers
I agree with the answer is 54321

Log in to add a comment
Some one who have posted this answer has misguided us

Log in to add a comment
http://www.emis.de/journals/EJC/Volume_13/PDF/v13i1r68.pdf

Log in to add a comment
52314 is the correct ans. for using permutations rules

Log in to add a comment
this is correct answer first push 5,4,3 in the stack and then pop them ns we get 3,4,5 and then push 2,1 and we get 1,2 so answer is 3,4,5,1,2

Log in to add a comment
yup R8 54321

Log in to add a comment
i think there is something wrong

Log in to add a comment
how it can be?

Log in to add a comment
correct answer is 5,4,3,2,1 because stact is a LIFO device

Log in to add a comment
Related Questions
 [A] Dynamic programming
 [B] Backtracking
 [C] Divide and conquer
 [D] Greedy method
 [A] Stack
 [B] Set
 [C] List
 [D] Queue
 [A] padent
 [B] isolated vertex
 [C] null vertex
 [D] colored vertex
 [A] quick sort
 [B] merge sort
 [C] heap sort
 [D] insertion sort