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

another thing is, some algorithms have a big constant factor. a O (N^2) might have a big constant factor that won't make it really practical to use ( if N is small enough as kindly noted by Thorban)