The inequality is $1000n^3<2^n$ I'm trying to see for what value of $n$ an algorithm A who takes ($1000n^3$) steps takes less time than another algorithm B who takes($2^n$) steps.
Any idea how to do that step by step?
The inequality is $1000n^3<2^n$ I'm trying to see for what value of $n$ an algorithm A who takes ($1000n^3$) steps takes less time than another algorithm B who takes($2^n$) steps.
Any idea how to do that step by step?
Copyright © 2021 JogjaFile Inc.