How do I find the Big Oh of more complex functions (functions with log)? Computer Science

---

• How do I find the Big Oh of more complex functions (functions with log)?
• How to find the worst case running time of a recursive algorithm?
• Useful search engines

How do I find the Big Oh of more complex functions (functions with log)? Posted: 23 Apr 2021 02:15 PM PDT Example from a review I'm working on (fwiw, not graded; any help here will only assist my understanding, not in cheating on an assignment or anything): https://imgur.com/a/WuFO3lG Most of these have me lost. I can easily say which is better between N5 and 5N2, but for example 500N log(N5) confused me. How do I do these sorts of problems that have log in them? submitted by /u/Missing_Back [link] [comments]

How to find the worst case running time of a recursive algorithm? Posted: 23 Apr 2021 10:11 AM PDT For example: int silly(int n, int m){ if (m < 2) return m; if (n < 1) return n; else if (n < 10){ return silly(n/m, m); } else { return silly(n-1, m); } } I came up with O(n logn) but this is evidently too loose of a worse case running time. I'm sort of lost as to how to go about this. submitted by /u/Missing_Back [link] [comments]

Useful search engines Posted: 23 Apr 2021 09:09 PM PDT I was curious what everyone likes to use for search engines. Obviously there's the big ones like * Google * Bing * Duckduckgo I've also found that this one is okay because it's like Google but has better privacy * Startpage Any other favorites? And why? submitted by /u/Pacman042 [link] [comments]

You are subscribed to email updates from Computer Science: Theory and Application. To stop receiving these emails, you may unsubscribe now.	Email delivery powered by Google
Google, 1600 Amphitheatre Parkway, Mountain View, CA 94043, United States