Question

What is the smallest value of n such that an algorithm whose running time is (2^15)n runs faster than an algorithm whose running time is 2^n on the same machine?
Steve
If you haven't already written your own routine, google one of your choosing. You should "zero" in on n ≈ 19.2681