Re: ,,improve'' readability in tree(3)
This is a discussion on Re: ,,improve'' readability in tree(3) within the lucky.openbsd.tech forums, part of the OpenBSD category; --> > > lg -> log > > No, the original is correct. lg means log base 2. Technically, it's ...
| |||||||
| FAQ | Members List | Calendar | Search | Today's Posts | Mark Forums Read |
02-22-2008, 01:10 PM
| ||||
| ||||
 Re: ,,improve'' readability in tree(3) > > 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      |
Linear Mode
