Re: this problem comes from chapter 1 of introduction to algorithms

Path	csiph.com!v102.xanadu-bbs.net!xanadu-bbs.net!feeder.erje.net!eu.feeder.erje.net!eternal-september.org!feeder.eternal-september.org!aioe.org!.POSTED!not-for-mail
From	Kaz Kylheku <kaz@kylheku.com>
Newsgroups	comp.programming
Subject	Re: this problem comes from chapter 1 of introduction to algorithms
Date	Tue, 24 Mar 2015 14:29:04 +0000 (UTC)
Organization	Aioe.org NNTP Server
Lines	13
Message-ID	<20150324072038.363@kylheku.com> (permalink)
References	<cf55a80e-dac4-4707-a29a-0c2d26fd78f1@googlegroups.com>
NNTP-Posting-Host	OGJi3KNpFOhM58UHZwXj0w.user.speranza.aioe.org
X-Complaints-To	abuse@aioe.org
User-Agent	slrn/pre1.0.0-18 (Linux)
X-Notice	Filtered by postfilter v. 0.8.2
Xref	csiph.com comp.programming:5352

Show key headers only | View raw

On 2015-03-24, G G <gdotone@gmail.com> wrote:
> Question: is lg an abbreviation for log base 10
> or log base 2?

You have to clarify that with your textbook or instructor.

Though it is an ISO notation for the base 10 logarithm,
it does show up as a nonstandard notation for base 2.

I'd also be suspicious for the reason that base 10 logs don't come up that much
in the analysis of algorithm running times.  Basically that requires something
akin to a tree search that branches ten ways at each node, or otherwise reduces
an input set to 10% at each step.

Thread

this problem comes from chapter 1 of introduction to algorithms G G <gdotone@gmail.com> - 2015-03-23 20:53 -0700
  Re: this problem comes from chapter 1 of introduction to algorithms Richard Heathfield <rjh@cpax.org.uk> - 2015-03-24 07:25 +0000
  Re: this problem comes from chapter 1 of introduction to algorithms Kaz Kylheku <kaz@kylheku.com> - 2015-03-24 14:29 +0000
    Re: this problem comes from chapter 1 of introduction to algorithms G G <gdotone@gmail.com> - 2015-03-24 14:25 -0700

csiph-web