We consider two algorithms that carry out the same computation.

Algorithm $1$ needs $100$n flops and algorithm $2$ needs n$2$ flops.

Considering only the flops to determined the speed of the algorithm, which of the following is correct?

$$

If n is larger than $100,$ then algorithm $1$ is faster.

$$

Algorithm $1$ is always faster

$$

It cannot be decided which algorithm is faster