Quantcast

Got Homework?

Connect with other students for help. It's a free community.

  • across
    MIT Grad Student
    Online now
  • laura*
    Helped 1,000 students
    Online now
  • Hero
    College Math Guru
    Online now

Here's the question you clicked on:

55 members online
  • 0 replying
  • 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)

  • 6 months ago
  • 6 months ago

  • This Question is Closed
  1. e.mccormick Group Title
    Best Response
    You've already chosen the best response.
    Medals 1

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

    • 5 months ago
  2. Ante Group Title
    Best Response
    You've already chosen the best response.
    Medals 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.

    • 5 months ago
  3. Mandre Group Title
    Best Response
    You've already chosen the best response.
    Medals 0

    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.

    • 3 months ago
  4. Bhavishya Group Title
    Best Response
    You've already chosen the best response.
    Medals 0

    Its O(len(prefixes))

    • 3 months ago
    • Attachments:

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
  • 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.

This is the testimonial you wrote.
You haven't written a testimonial for Owlfred.