Why a programmer would prefer O(N^3) instead of O(N^2)

Question

I was studying for my final exam and there is a question in the archive that I cannot find its answer:

The order-of-growth of the running time of one

Answer 1

Adding to the already posted answers I'd like to mention cache behaviour. A particular memory access pattern might be so much slower due to repeated cache misses that a theoretically slower algorithm with a more cache friendly memory access pattern performs much better.