Given an algorithm taking a collection of n items (each item being of fixed size) as input, with respect to what should its complexity be analysed?

How many times will the marked line in the following code run when the input integer is n?

def mystery(n):
    stamp = 0
    if n <= 0:
        return 0
    else:
        for i in range(n):
            for j in range(n):
                stamp += j          # This line
    
    return stamp

Answer in terms of n

What is the purpose of this function? 

def cipher(my_array):
    sherlock = my_array[0]
    watson = my_array[-1]
    moriarty = 0
    for villain in my_array:
        if villain > sherlock:
            moriarty += 1
        elif villain < watson:
            watson = villain
 
    return sherlock, moriarty

Consider the following implementation of a class for a Monash student: 

class Student:
    def __init__(self, name, stud_id):
        self.name = name
        self.stud_id = stud_id
    
    def __le__(self, other):
        # TODO: Finish implementation

What will be the returned value from the following function: 

def mystery(lst):
    bango = []
    for unicorn in lst:
        if unicorn % 2 == 0 or str(unicorn) > "2":
            bango.append(unicorn)
    return len(bango)

when the value of lst is [0, 1, 2, 3, 3, 5, -0, 6, 7, -8]

What will be the returned value from the following function: 

def mystery(lst):
    bingo = 0
    for i in range (0,len(lst)-1, 2):
        if lst[i] % 2 == 0 or str(lst[i]) > "4":
            bingo += 1
    return bingo

when the value of lst is [0, 1, 2, 3, 3, 5, -3, 6, 7, -4]

How many times will the marked line in the following code run when the input integer is n?

def mystery(n):
    if n <= 1:
        return 1
    else:
        return mystery(n-1) + mystery(n-2) # This line

Answer in terms of n

Consider the following implementation of a class for a Monash student: 

class Student:
    def __init__(self, name, stud_id):
        self.name = name
        self.stud_id = stud_id
    
    def __gt__(self, other):
        # TODO: Finish implementation

What will be the returned value from the following function: 

def mystery(lst):
    bongo = 0
    for item in lst:
        if item // 2 == 0 or str(item) < "2":
            bongo += 1
    return bongo

when the value of lst is [0, 1, 2, 3, 3, 5, -0, 6, 7, -8]

What is the purpose of this function? 

def enigma(my_list):
    paul = my_list[0]
    george = my_list[-1]
    for ringo in range(len(my_list)):
        if my_list[ringo] > paul:
            paul = my_list[ringo]
        elif my_list[ringo] < george:
            george = my_list[ringo]
    
    return george, paul