# Exercise 1.2.3

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

At $n > 14$, the first algorithm runs faster.