def f(n):
    def g(m):
        m = 0
        for i in range(m):
            print(m)
    for i in range(n):
        g(n)

#what is the big O complexity?
#I answered n^2. I guess it's actually n.
# Is that because it is always just printing the same thing, so the only thing that affects the speed is the size of n, linearly? 

f(3)
f02b8ba067f8f3011a5e95bc72c4a6e2e0ae67f6
<mask token>

def f(n):

    def g(m):
        m = 0
        for i in range(m):
            print(m)
    for i in range(n):
        g(n)


<mask token>

def f(n):

    def g(m):
        m = 0
        for i in range(m):
            print(m)
    for i in range(n):
        g(n)


f(3)

def f(n):
    def g(m):
        m = 0
        for i in range(m):
            print(m)
    for i in range(n):
        g(n)

#what is the big O complexity?
#I answered n^2. I guess it's actually n.
# Is that because it is always just printing the same thing, so the only thing that affects the speed is the size of n, linearly? 

f(3)