Hey guys. Help me write an array implemented Python program to implement Stack operations.

Question

Implementing Stack Operations using Python

Answer 1

Hey Ipang , yes you posted the code, but it makes no sense to just replicate it. Why dont we discuss it and see where the pop, push and the other functions are coming from and what they mean. I'd be pleased to get an explanation.

Answer 2

Oh ok. Then it seems i still have a lot to learn. Thanks Donato Paul Thayalan

Answer 3

https://code.sololearn.com/cu81QDDGeTTf/?ref=app

Answer 4

Donato Paul Thayalan thanks.💪

Answer 5

Hey Donato Paul Thayalan , I've been quiet trying to grasp what you've said but still nothing seems to make sense to me.

Answer 6

Ok Donato Paul Thayalan , i get the theoretics behind what you've said, but the code, I've been trying to run it but it doesn't seem to output anything. Is it complete like this or there's something that I'm missing?

Answer 7

I tried to run the one Ipang sent initially

Answer 8

Hey guys Ipang and Donato Paul Thayalan, i think i have finally managed to get the hang of the code i was talking about. Let me post the code i wrote here and see if you guys agree

Answer 9

Oh ok. But its legit right?

Answer 10

https://www.sololearn.com/learn/680/?ref=app

Answer 11

So imagine the stack being like a literal stack of objects in irl. The self.items is an ordered list of the items on the stack. So when you are calling the push function, the code is basically inserting the item at the front of the list (python implictly reindexes items that are already in the list). When the pop is called, it returns the item at the front of the list and removes it from the list, essentially making the previously pushed item (previous to the popped item) at the front of the list. So basically the stack can model e.g. a stack of documents, when you push onto the stack you put a document on top of it and when you pop from the stack you take the document on top off of the stack. That is why the stack is called a LIFO (last-in-first-out) data structure, since the last item pushed onto it is also the first, and only one that can be popped off the stack.

Answer 12

The other two functions aren't really necessary for the stack to work by itself but it helps you get data and information about it. The is_empty function just compares the stack's list with an empty one and return this comparison as an true-or-false value (if true, the stack is empty). The print_stack function just prints the stack from top to bottom.

Answer 13

What Ipang sent you is just class, which isn't a program by itself. You will have to initialize the stack and operate on it yourself. e.g.

<class Stack definition>

s = Stack()
s.push(<any object>)
...

^ is how you should be using it (angular brackets are placeholders)

Answer 14

Is it possible for you to send the program text you have written/are trying to run?

Answer 15

No problem. Have fun learning! ;)

Answer 16

Nice, what you did is a functional approach to model a stack, whereas the other is object-oriented.

Answer 17

Sorry for the delay, haven't been on SoloLearn for about a week, but yes, there's nothing wrong with the code.