Big Oh Analysis Result

Question

I just formulated an algorithm for a problem and I analysed it to be O(2m+n) but we are supposed to get O(m+n) so I want to know if O(2m+n) = O(m+n).

For Big-O analysis in the common sense, given that `m` and `n` are two independent variables, `O(m+n)` itself would generally reduce to `O(m)` or `O(n)` depending on which variable we choose to study (in the context on the asymptotic behaviour of our algorithm w.r.t. one of these variables). _"The implicit assumption is that these properties extend to more than one variable. In this paper, we demonstrate that this assumption, which seems to pervade the computing literature, is invalid."_ from [On Asymptotic Notation with Multiple Variables](http://people.cis.ksu.edu/~rhowell/asymptotic.pdf) — dfrib, Feb 11 '16 at 12:05

score 3 · Accepted Answer · edited May 23 '17 at 12:31

3

Yes, it is. Big O ignores constants. So O(m +n) is the same as O(100000m + 50n)

edited May 23 '17 at 12:31

Community

answered Feb 11 '16 at 05:48

Salvador Dali

1 Answers1