|
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)
kjell
pintday.org
Date: Wed Mar 08 2006 - 16:28:29 CST
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]
> > lg -> log
>
> No, the original is correct. lg means log base 2.
Technically, it's half right, since the constant which differentiates
(lg n) from (log n) is eaten by the big-O.
But I'll go back under my rock now.
> > -Every operation on a red-black tree is bounded as O(lg n).
> > -The maximum height of a red-black tree is 2lg (n+1).
> > +Every operation on a red-black tree is bounded as O(log n).
> > +The maximum height of a red-black tree is 2log(n+1).
> > .Pp
> > A red-black tree is headed by a structure defined by the
> > .Fn RB_HEAD
-kj
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]