OSEC

Neohapsis is currently accepting applications for employment. For more information, please visit our website www.neohapsis.com or email hr@neohapsis.com
 
Re: ,,improve'' readability in tree(3)

From: Thordur I. Bjornsson (thibmi.is)
Date: Wed Mar 08 2006 - 16:50:35 CST

Thorsten Glaser <tgmirbsd.de> wrote on Wed 8.Mar'06 at 22:33:03 +0000

> Peter Valchev dixit:
>
> >> lg -> log
> >
> >No, the original is correct. lg means log base 2.
>
> Isn't that lb?
>
I was under that expression (log base 2 -> lb) never seen
,,lg'' before.

And (no that I generally trust wikipedia) you see for example
that:

'' Balance Theorem: The cost of performing the sequence S is O(m(logn + 1) + nlogn).
In other words, splay trees perform as well as static balanced
binary search trees on sequences of at least n accesses. ''

-> http://en.wikipedia.org/wiki/Splay_tree

--
Thordur I. Bjornsson
Humppa!