This is how we get software that run ten times slower consumes ten times more resources and this happens on occasion when software works, more often it doesn't.
Big-O notation lets you conveniently ignore constant factors like 'ten times'.
(I'm only half joking. A system that's always ten times slower than the optimal solution, can still be beneficial to one that's quadratically slower than the optimal solution. Or it can be worse, it depends on how big your instances are.)
(I'm only half joking. A system that's always ten times slower than the optimal solution, can still be beneficial to one that's quadratically slower than the optimal solution. Or it can be worse, it depends on how big your instances are.)