## Big O Notation - explained as easily as possible

Data Structures and Algorithms is about solving problems efficiently. A bad programmer solves their problems inefficiently and a really bad programmer doesn't even know why their solution is inefficient. So, the question is,

How do you rank an algorithm's efficiency?The simple answer to that question is the

Big O Notation. How does that work? Let me explain!

Source: Big O Notation - explained as easily as possible, an article by Conrad Reeves.