A community for students.
Here's the question you clicked on:
 0 viewing
KEM
 one year ago
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)
KEM
 one year ago
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)

This Question is Closed

e.mccormick
 one year ago
Best ResponseYou've already chosen the best response.1Well, I see a problem with suffix = "ack" No u.

Ante
 one year ago
Best ResponseYou've already chosen the best response.0You 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.

Mandre
 one year ago
Best ResponseYou've already chosen the best response.0Using 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.

Bhavishya
 11 months ago
Best ResponseYou've already chosen the best response.0Its O(len(prefixes))
Ask your own question
Sign UpFind more explanations on OpenStudy
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.