Question

What is the complexity of this program.?

Here is it:

prefixes = "JKLMNOPQ"
suffix = "uack"

def comp(x):
for letter in prefixes:
print letter + suffix

comp(prefixes)

Answer 1

Well, I see a problem with suffix = "ack" No u.

Answer 2

You can either modify the loop or the prefixes variable, I'd suggest the latter. Maybe you can separate the prefixes in a way that Q and O both have a 'u' attached to them.

Answer 3

Using Big-O notation it looks like O(n) to me, but I must admit I need to review complexity again. I'm a bit out of practice.

Answer 4

Its O(len(prefixes))