Re: generate De Bruijn sequence memory and string vs lists

References	(5 earlier) <lbrugd$k3a$1@ger.gmane.org> <CALyJZZU2J3n67LwF1a2-6eeMZ=J18zbj8h+QV-w7Ujz=kHkgOw@mail.gmail.com> <lbs0nm$f4t$1@ger.gmane.org> <CALyJZZU8R8pn9sCNgTqn9ieajayjFjkoG6sQCS6xWWLhxhWm-w@mail.gmail.com> <lbt7sa$d60$1@ger.gmane.org>
From	Vincent Davis <vincent@vincentdavis.net>
Date	2014-01-24 07:08 -0600
Subject	Re: generate De Bruijn sequence memory and string vs lists
Newsgroups	comp.lang.python
Message-ID	<mailman.5939.1390570701.18130.python-list@python.org> (permalink)

Show all headers | View raw

[Multipart message — attachments visible in raw view] - view raw

On Fri, Jan 24, 2014 at 2:23 AM, Peter Otten <__peter__@web.de> wrote:

> Then, how do you think Python /knows/ that it has to repeat the code 10
> times on my "slow" and 100 times on your "fast" machine? It runs the bench
> once, then 10, then 100, then 1000 times -- until there's a run that takes
> 0.2 secs or more. The total expected minimum time without startup overhead
> is then
>

Ah, I did not know about the calibration. That and I did not notice the
100 on my machine vs 10 on yours.

Vincent Davis

Back to comp.lang.python | Previous | Next | Find similar | Unroll thread

Thread

Re: generate De Bruijn sequence memory and string vs lists Vincent Davis <vincent@vincentdavis.net> - 2014-01-24 07:08 -0600

csiph-web