Computational Science Stack Exchange is a question and answer site for scientists using computers to solve scientific problems. It only takes a minute to sign up.
Sign up to join this community
I have written an algorithm where the 2 input arguments are a file and a list of values. I would like to say the algorithm complexity is:
O(max{n,m}) where n is the size of the file and m is the length of the list
But maybe I'm mixing apples and oranges here. What is the correct way to write or express this?
Writing $O(m)+O(n)$ avoids the problem of having to address units. Note that $\max(m,n)$ and $m+n$ have the same order, and having max in a Landau symbol is quite uncommon.
