Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]

Groups > comp.programming > #5352

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

Show all headers | 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.

Back to comp.programming | Previous | Next — Previous in thread | Next in thread | Find similar | Unroll thread

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