i think i meant to say that n^3 grows faster then n^2 for q.d). And Cos they dont grow at the same speed, ans is no. Then is that right?
In particular it's because
isn't between the two bounds (it's not
i think im confusing myself here.
but for a) in
Okay, so i know that comparing
grows faster. And
is faster than
So, having said that is it consistent with the fact that the alrogithm whose running time is in
? Because it is within the bounds of both running times. Does that make sense?
Or... is it because, the question says, no faster than
, but the algorithm can run faster than
and up to
? So answer is inconsistent.