Skip to main content


Showing posts from October, 2015

Stack Implementation in Python

Stack is one of important concepts in data structure. Stack can be defined as abstract data type (ADT) that collects items with LIFO (last in, first out) principle. Two operations are known for stack i.e. push and pop. Push will add an item into stack, while pop will remove the last element that was added into stack.  You may think stack concept as if you arrange your plates. You will put a plate above other plates, but when you want to take one plate, you will take it from the top. To implement it in python, you will have at least three methods i.e. __init__, push, and pop. However, here we will add some more methods i.e. isEmpty (to check if the stack is empty), peek (to get the item at the top) and size(to get the number of item(s) in the stack). Here are the implementation in python: class Stack: def __init__(self): self.items = [] def isEmpty(self): return self.items == [] def push(self, item): self.items.append(item) def pop(self)

Dragon Ball Super Opening Lyrics (Chozetsu - Dynamic)

Itsuka Togireta  yume no tsudzuki Hajimeyou    Hoshi o tsunagete  Sora ni tobira kakebaii    arata na suteeji wa  Kami ni idomu basho    Kyouretsu - mouretsu -dynamic! Let's Go! GO ! daipanikku  Makeru to tsuyoukunaru    Minohodo shirazu ni wa  koukai toka genkai toka nai mon     Souzetsu-chouzetsu-dynamic! Let's Go! Yes ! renda kikku  abisete mushaburui    sugee koto ga matterun da ze