Why does Big O only need its bound to hold past some crossover point, and why is that freedom also its biggest weakness?
Short drills on what this video just taught. Write the code, run the checks, and reveal the answer only if you are stuck.
f is already defined as the video's count, . A line with a big enough c starts out above it, and the video claims no constant keeps it there. Define first_below(c) that steps x up from 1 and returns the first whole number at which c * x is below f(x).
def f(x):
return 3 * x ** 2 + 20 * x + 1