home *** CD-ROM | disk | FTP | other *** search
- Xref: sparky comp.lang.c:19072 comp.lang.c++:18591 comp.misc:4733
- Newsgroups: comp.lang.c,comp.lang.c++,comp.misc
- Path: sparky!uunet!zaphod.mps.ohio-state.edu!cs.utexas.edu!csc.ti.com!tilde.csc.ti.com!mksol!mccall
- From: mccall@mksol.dseg.ti.com (fred j mccall 575-3539)
- Subject: Re: What is Object Oriented Programming? Is C doomed?
- Message-ID: <1992Dec31.143456.24812@mksol.dseg.ti.com>
- Organization: Texas Instruments Inc
- References: <1992Dec28.015333.5242@ucc.su.OZ.AU> <1992Dec29.211256.188@fcom.cc.utah.edu> <1992Dec30.173627.2696@netcom.com> <1992Dec30.204142.16778@informix.com>
- Date: Thu, 31 Dec 1992 14:34:56 GMT
- Lines: 27
-
- In <1992Dec30.204142.16778@informix.com> cshaver@informix.com (Craig Shaver) writes:
-
- >In article <1992Dec30.173627.2696@netcom.com> nagle@netcom.com (John Nagle) writes:
- >>swillden@news.ccutah.edu (Shawn Willden) writes:
- >>> Is this scheme similar to the one you had in mind? If yours
- >>>is better, please share it (or provide references, I suppose I ought
- >>>to check Knuth to see if he has anything like this).
- >>>In any case, I like the idea well enough that I think I'm going to
- >>>start using it.
- >>
- >> Look into B-trees for this sort of thing. But don't look in
- >>Knuth's "Art of Computer Programming" for them; they postdate that classic
- >>work.
- >>
- >> John Nagle
-
- >I believe Knuth covers b-trees and b+trees in vol. 3, sorting and searching.
-
- Quite correct. See _The Art of Computer Programming_, Vol 3, "Sorting
- and Searching", on pp 473-480. B-trees and refinements of B-trees are
- covered as one part of the chapter on multiway trees under "Sorting".
-
- --
- "Insisting on perfect safety is for people who don't have the balls to live
- in the real world." -- Mary Shafer, NASA Ames Dryden
- ------------------------------------------------------------------------------
- Fred.McCall@dseg.ti.com - I don't speak for others and they don't speak for me.
-