Got Homework?
Connect with other students for help. It's a free community.
Here's the question you clicked on:
 0 viewing
KEM
Group Title
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)
 4 months ago
 4 months ago
KEM Group Title
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)
 4 months ago
 4 months ago

This Question is Closed

e.mccormick Group TitleBest ResponseYou've already chosen the best response.1
Well, I see a problem with suffix = "ack" No u.
 4 months ago

Ante Group TitleBest ResponseYou've already chosen the best response.0
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.
 4 months ago

Mandre Group TitleBest ResponseYou've already chosen the best response.0
Using BigO 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.
 one month ago

Bhavishya Group TitleBest ResponseYou've already chosen the best response.0
Its O(len(prefixes))
 one month ago
See more questions >>>
Your question is ready. Sign up for free to start getting answers.
spraguer
(Moderator)
5
→ View Detailed Profile
is replying to Can someone tell me what button the professor is hitting...
23
 Teamwork 19 Teammate
 Problem Solving 19 Hero
 Engagement 19 Mad Hatter
 You have blocked this person.
 ✔ You're a fan Checking fan status...
Thanks for being so helpful in mathematics. If you are getting quality help, make sure you spread the word about OpenStudy.