From mboxrd@z Thu Jan  1 00:00:00 1970
X-Spam-Checker-Version: SpamAssassin 3.4.4 (2020-01-24) on polar.synack.me
X-Spam-Level: 
X-Spam-Status: No, score=-1.3 required=5.0 tests=BAYES_00,INVALID_MSGID
	autolearn=no autolearn_force=no version=3.4.4
X-Google-Language: ENGLISH,ASCII-7-bit
X-Google-Thread: 103376,5cbfcb03a9d3d935
X-Google-Attributes: gid103376,public
From: dewar@merv.cs.nyu.edu (Robert Dewar)
Subject: Re: Help B* and B+ Trees
Date: 1998/05/14
Message-ID: <dewar.895192005@merv>#1/1
X-Deja-AN: 353358132
References: <6je5il$ecf$1@news.iinet.net.au> <355B0B39.7A3673D5@earthling.net>
X-Complaints-To: usenet@news.nyu.edu
X-Trace: news.nyu.edu 895192119 1461 (None) 128.122.140.58
Organization: New York University
Newsgroups: comp.lang.ada
Date: 1998-05-14T00:00:00+00:00
List-Id: <comp.lang.ada>


Charles says

<<Well... depending on your level of expertise, Knuth wrote the book on
this one.  Warning: He uses assembly code for a pseudo-machine in his
explanations!
>>


This is quite unfair to Don, he explains algorithms in a high level
manner using abstract pseudo-code. MIX is only used in low level analysis
of actual performance on a typical machine, i.e. to get a feel for the
constants involved and go from O(n**2) to C*n**2, you need a concrete
machine!