How Big O reveals when code will collapse

Instead of measuring how fast a program is, computer scientists use Big O notation to describe how spectacularly it will collapse under pressure. It mathematically maps out whether an algorithm will take an extra millisecond or four thousand years to process larger datasets. It is the academic way of saying 'your code is terrible and here is the graph to prove it'.