Complexity classes in Python

Question

In python for complexity classes,

 

If we return a tuple like (v,k+1), is that return statement a complexity class of O(N) because of tuple containment? 

 

The function is like this:

 

def sum(dicty):

    for k,v in dicty.items():

        return (v,k+1)

Answer 1

The function you've provided above will run in O(1) time: the for loop is entered, and immediately returns the first (key, value) pair (in the form (value, key+1)) it comes across.

It doesn't matter if N = 1,000,000 or N = 5 (I assume that N denotes the number of (key, value) pairs in dicty); the method always returns after just one iteration.