Quantcast

A community for students.

Here's the question you clicked on:

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

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

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

  2. Ante
    • one year ago
    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.

  3. Mandre
    • one year ago
    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.

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

    Its O(len(prefixes))

  5. Not the answer you are looking for?
    Search for more explanations.

    • Attachments:

Ask your own question

Sign Up
Find more explanations on OpenStudy
Privacy Policy

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.