Path: csiph.com!eternal-september.org!feeder.eternal-september.org!news.eternal-september.org!.POSTED!not-for-mail
From: Ben Bacarisse <ben.usenet@bsb.me.uk>
Newsgroups: comp.lang.javascript
Subject: Re: Update only if not already in array
Date: Tue, 07 Mar 2017 11:23:30 +0000
Organization: A noiseless patient Spider
Lines: 27
Message-ID: <87wpc11gb1.fsf@bsb.me.uk>
References: <dd6d3d32-1e0b-4002-93ea-90c28f99f1c2@googlegroups.com> <f8e6263d-08e6-46c0-b170-6a42c0b7b9fa@googlegroups.com> <XnsA72D84A6292C9eejj99@194.109.6.166> <ab53c3c5-cc95-44a5-8250-de3f272fa8a7@googlegroups.com> <XnsA72DBA8A7DAA8eejj99@194.109.6.166> <567cadf8-91e1-4e1d-9183-09b60658ec39@googlegroups.com> <XnsA72DF106C4931eejj99@194.109.6.166> <72c9bb07-427c-4256-bc82-0b0a3acd6cc5@googlegroups.com> <XnsA72E14CC5889eejj99@194.109.6.166> <8e90e371-950e-4774-89f4-1c54566745fa@googlegroups.com> <20ca53b3-e664-4d34-86ec-1bc0e5fb4b1e@googlegroups.com> <87o9xhjb00.fsf@bsb.me.uk> <8fae31a5-24ba-46ac-a746-299a4eb57671@googlegroups.com> <87efyckbg4.fsf@bsb.me.uk> <6758a153-c068-4bbb-b890-52bc05066870@googlegroups.com> <8760jok1m3.fsf@bsb.me.uk> <3aa0dc8d-a808-4583-809c-c74fffda0e08@googlegroups.com> <87mvczhiq5.fsf@bsb.me.uk> <e9f3a0ca-0a50-40d2-a99b-af2fb982d756@googlegroups.com> <8737ep3o6e.fsf@bsb.me.uk> <10793909.O9o76ZdvQC@PointedEars.de>
Mime-Version: 1.0
Content-Type: text/plain
Injection-Info: mx02.eternal-september.org; posting-host="54022d1693a47b06fd1230219a4db6d9"; logging-data="23633"; mail-complaints-to="abuse@eternal-september.org";	posting-account="U2FsdGVkX1/dd2mGZxKb0uv4sm5OcjHsy9oRSp3SMMQ="
Cancel-Lock: sha1:C2KxPIXIrkUMFOM7uG4ZCyUahS8= sha1:FigHC2FIoYpW0nefjPw8Xy5oGuk=
X-BSB-Auth: 1.14e8eb0b000245ec6d4a.20170307112330GMT.87wpc11gb1.fsf@bsb.me.uk
Xref: csiph.com comp.lang.javascript:32704

Thomas 'PointedEars' Lahn <PointedEars@web.de> writes:

> Ben Bacarisse wrote:
>
>> "Michael Haufe (TNO)" <tno@thenewobjective.com> writes:
>>> Big-O is the upper-bound specifically. Whatever the input,
>>> the resulting time will not exceed this bound by definition,
>>> otherwise it wouldn't be the upper bound.
>> 
>> It's not an upper bound in that sense -- it's the asymptotic upper
>> bound, up to a constant factor.  It states (in this case) that there
>> is some constant C and some integer M such that
>> 
>>   steps_taken_by(small(k)) > C*k^3 for all k > M.

  steps_taken_by(small(k)) < C*k^3 for all k > M.

(Some people use <= and >= for one or other but that makes no difference.)

> No, it does not.

Indeed, a typo.  Surely just pointing out the swapped comparison would
have been more helpful?  Anyway, thanks for noticing and if there is
anything else, maybe you could say what?

-- 
Ben.