Steve M
Reputation: 9794
What is the standard way of writing O(max(n, m))?
What is the standard way of writing "the big-O of the greatest of m and n"?
Upvotes: 3
Views: 90
Answers (1)
user2357112
Reputation: 281683
It can be written as
O(m+n)
It might not look the same at first, but it is, since
max(m, n) <= m+n <= 2max(m, n)
If you want, you can also just write O(max(m, n))
Upvotes: 8
Related Questions
- Big-O notation of an algorithm that runs max(n,0) times?
- Is O(m+n) the same as (O(max(m,n))?
- When is an algorithm O(n + m) time?
- 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))
- Difference between O(m+n) and O(mn)?
- Asymptotic Notation max(m,n)=O(m+n)
- What's the big O of an algorithm that does n-m operations, where m is the iteration number?
- Big-O/Big-Oh Notation