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 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> References: 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 On 2015-03-24, G G 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.