What is the standard way of writing O(max(n, m))?

algorithm, time-complexity

Solution

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))`

Problem

Original source