WhiteBlackGoose/GuessBigO

More advanced algo

Opened this issue · 0 comments

Currently we can't ever guess a ^ x, unless a is e or 2. But if we take logarithm, it would be:

a ^ x         ln(a ^ x)
-----    -->  --------- = ln(a)
e ^ x         ln(e ^ x)

Now, after taking ln, we make a backward operation and get that it's O(e^(ln(a)x))