Sort a Stack | Recursion | Programming Tutorials

[@arsrivaszaredan8217]

omg! THANKS VERY MUCH !!! it's a really good way to solve this problem, and a nice explanation

[@ProgrammingTutorials1M]

Thank you

[@srisakthigajapathy4748]

Excellent video. Very clear. Hats off to you. Keep going.

[@ProgrammingTutorials1M]

Thanks a lot.

[@charanreddy2113]

Good Explanation !!

[@ushaveeramallu9923]

Nice explanation

[@ProgrammingTutorials1M]

Thanks and welcome

[@shaharrefaelshoshany9442]

Best ever!!!!!

[@ProgrammingTutorials1M]

Thank you

[@amlansahoo07]

Nice explanation.

[@ProgrammingTutorials1M]

Thank you.

[@surajgrandhi6742]

Sir, temp should be initialize as stack , and why we have initialized as int

[@ProgrammingTutorials1M]

We have to sort a stack, so first we have to pop all the values from a stack and keep them in a function call.

[@ProgrammingTutorials1M]

Sort a Stack using Recursion Code link is present in the description box.

[@yashwanthv785]

hey cant we do it without popping all elements

[@ProgrammingTutorials1M]

We have to use only recursion to solve this problem. Without popping how do you solve? I am curious to know your thoughts.

[@yashwanthv785]

@@ProgrammingTutorials1M we will still use recursion but instead of popping all elements we will single element check with top and later use recursion according

[@ProgrammingTutorials1M]

Can you please share the code.

[@kunalchandra9682]

brother you stammer too much.. please speak calmly..it make the understanding better..

[@aaaa-pr2dd]

I think this is ascending order.