algorithm - Asymptotic Notation max(m,n)=O(m+n) -
i have studied introduction algorithms clrs in great details,but 1 thing not clear yet.
why max(m,n)=o(m,n)?
please explain,it great help!
max(m, n) = o(m+n)
means that, asymptotically speaking, max(m, n)
doesn't grow more m+n
. since max(m, n) < m + n
m, n
, must true. note max(m, n)
equal either m
or n
, either of guaranteed less m + n
(as long m
, n
nonnegative, can assumed).
Comments
Post a Comment