#data structures calculating time complexity and the big o notation
8 messages · Page 1 of 1 (latest)
- 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.
- Wait patiently for a helper to come along.
- Once someone helps you, say thank you and close the thread with:
+close - Feel free to nominate the person for helper of the week in #helper-nominations
- Do not ping the mods, unless someone is breaking the rules.
- If you're happy with the help you got here, and the server overall, you can contribute financially as well:
I was wondering how to calculate d and e and their run time complexity and big o notation especially with the modules if statements
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?
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
the texit gods have descended