Neri-kun
Reputation: 193
Is O(m+n) the same as (O(max(m,n))?
If I have two variables,say m and n,and my algorithm has time complexity O(m+n),is O(m,n) the same as having O(max(m,n))?If yes,can you explain why?
Upvotes: 0
Views: 445
Answers (1)
GaryO
Reputation: 6338
Yes. Because O(m+n) is always smaller than O(2(m+n)), which only differs by a constant factor from O(m+n), and max(m+n) < 2(m+n). That's just one way to analyze it.
Upvotes: 2
Related Questions
- For an algorithm with a time complexity of O(N+M), if M is always less than N, can we say the time complexity will be O(N)?
- What is the meaning of O(M+N)?
- Complexity of O(M+N)
- How to determine if the time complexity is O(m + n) or O(Math.max(m, n))
- Comparing complexity of O(n+m) and O(max(n,m))
- Understanding Time complexity of O(max(m,n))
- What is the difference between O(N) + O(M) and O(N + M). Is there any?
- Difference between O(m+n) and O(mn)?
- Asymptotic Notation max(m,n)=O(m+n)
- Is O(n+m) equal to O(n) if m is known to be less than n in all cases?