In the above example, the display_first_cube element calculates the cube of a number. That number happens to be the first item of the list that passed to it as a parameter. No matter how many elements there are in the list, the display_first_cube function always performs two steps. First, calculate the cube of the first element. Second, print the result on the console. Hence the algorithm complexity remains constant (it does not scale with input).

Let’s plot the constant algorithm complexity.

xxxxxxxxxx

import numpy as np

import matplotlib.pyplot as plt

​

num_of_inputs = np.array([1,2,3,4,5,6,7])

steps = [2 for n in num_of_inputs]

plt.plot(num_of_inputs, steps, 'r')

plt.xlabel('Number of inputs')

plt.ylabel('Number of steps')

plt.title('O(c) Complexity')

​

plt.show()

​

# No matplotlib support in this terminal.

# Go to the next screen for the results!