What is the smallest value of n such that an algorithm whose running time is 100n2 runs faster than an algorit

Question

What is the smallest value of n such that an algorithm whose running time is 100n2 runs faster than an algorithm whose running time is 2n on the same machine?

Answer 1

There are no integers such that 100n^2 < 2n.

Do you mean 2^n rather than 2*n? for the right side?

Plot 2 curves, y=100n^2 and y=2^n.

I think they cross around n=16.