There are some important distinctions though, which gets lost if one takes the quote at face value without much context. For example, I think one should strive to avoid O(n^2) loops and similar unless one is absolutely positively certain n will forever be bounded to some sane value.

My point being that O(n^2) code can make the application completely unusable, which makes it something more than a pure optimization problem.