What complexity have a log(sum) shape?
Algo via Digitalmars-d
digitalmars-d at puremagic.com
Tue Dec 8 18:06:34 PST 2015
On Wednesday, 9 December 2015 at 01:40:12 UTC, Timon Gehr wrote:
> On 12/09/2015 02:02 AM, H. S. Teoh via Digitalmars-d wrote:
>> Big-O notation deals with asymptotic
>> behaviour as the variables approach infinity, so behaviour at
>> 'small'
>> values of m and n are irrelevant.
>
> The problem is, however, that only m /or/ n could be small.
Pretty sure as per property 1 (common, "weak" definition of
multi-variate O class) no variable can be "small". For all n >=
ntresh and for m >= mtresh the inequality must hold, and that's
only the weakest property.
More information about the Digitalmars-d
mailing list