---

Home Developer

Joy of Programming: Liskov?s Substitution Principle

By

“Every computer science student who has taken a data structure
course knows that a stack is not a vector. A vector is just like an
array, only that it can grow in size. So we can insert or delete
elements from anywhere in the vector. However, stack is a LIFO
(Last In First Out) data structure: we can insert and remove only
from one end of the data structure.


Complete Story

Get the Free Newsletter!

Subscribe to Developer Insider for top news, trends, & analysis

Must Read

LinuxToday is a trusted, contributor-driven news resource supporting all types of Linux users. Our thriving international community engages with us through social media and frequent content contributions aimed at solving problems ranging from personal computing to enterprise-level IT operations. LinuxToday serves as a home for a community that struggles to find comparable information elsewhere on the web.

Our Brands

Advertiser Disclosure: Some of the products that appear on this site are from companies from which TechnologyAdvice receives compensation. This compensation may impact how and where products appear on this site including, for example, the order in which they appear. TechnologyAdvice does not include all companies or all types of products available in the marketplace.