Yes bubble sort usually will take more time, but big O notation does not say that quick sort will be better for your real world problem.

Complexity estimations or just benchmarks are much better at that.

You should never limit yourself to big O notation when comparing algorithms.

>You should never limit yourself to big O notation when comparing algorithms.

Sure, but it's still an incredibly useful tool for considering how your algo will scale.