#data structures calculating time complexity and the big o notation

8 messages · Page 1 of 1 (latest)

dense flint
#

Hello this is hw and I was sick during the week he briefly (according to students in my class) went over one problem similar to the hw.Thank and have a good day!

hexed lindenBOT
#
  1. Ask your question and show the work you've done so far. If you've posted a screenshot of a question, specify which part you need help with.
  2. Wait patiently for a helper to come along.
  3. Once someone helps you, say thank you and close the thread with:
    +close
    
  4. Feel free to nominate the person for helper of the week in #helper-nominations
  5. Do not ping the mods, unless someone is breaking the rules.
  6. If you're happy with the help you got here, and the server overall, you can contribute financially as well:
dense flint
#

I was wondering how to calculate d and e and their run time complexity and big o notation especially with the modules if statements

meager heart
#

if the course assumed + and * to be fundamental operations with runtime O(1), i'd assume that they would consider the same for % as it depends on division which is similar to *

#

does that help?

dense flint
#

lol I’m forgot I posted this, yes it does help and thank you, I passed the class with an A I just took an L on this hw problem

pure crown
#

the texit gods have descended