Follow more CS videos @ http://hackercs.com..
Please like, comment, ask questions and subscribe so we can make more free CS videos :)
*Stack Implementation Part 1...
*Reason why the linked list implementation is less efficient: linked lists usually allocate memory dynamically for each element, and that overhead can be significant when dealing with small-sized elements (in the case of a dynamic array, heuristics can be used to minimize the number of times we resize, hence making it more efficient)
*Stack ADT Video Link: http://www.youtube.com/watch?v=u9QURmY6ACs