That's an over-generalization that is only valid for small input sizes. Consider:
- an O(N*log N) heap-sort implemented by a decent programmer in idiomatic high-level code.
- a dumb O(N^2) bubble-sort coded by an absolute assembly optimization wizard.
Your O(N^2) sort will probably be much faster for small input sizes, but it won't take a large input size for it to become dog-crap slow. You can improve constant factors all day, but that won't obviate the need for doing millions or billions of comparisons.
You can only take a dumb algorithm so far before it breaks down completely in practice.
This is not a theoretical thing either - in unoptimized codebases, I've often seen people finding low-hanging fruit by looking for inadvertent O(N^2) or even O(N^3) behaviour (usually it's not obvious nested loops, but looping hidden by indirection i.e. function calls) and replacing it with an O(N*log N) or O(N) alternative.