Here's an example of what I mean:
def complexity(n): count = 0 for x in range(1, n+1): for y in range(1, (n*n)+1): if y % n == 0: for z in range(1, n+1): count += 1 return count
The first for loop is of course θ(n), the second one θ(n^2). But what impact does the modulo operator have? And what would then be the complexity of the whole thing?