You need to log in to create posts and topics.
B-Tree code
77,940 Posts
#1 · December 3, 1997, 5:21 pm
Quote from Forum Archives on December 3, 1997, 5:21 pmPosted by: mcrm <mcrm@...>
Since no one seemed to have code that shows using B-Trees, I made some of my
own. If anyone wants it, e-mail me PRIVATELY at mcrm@lore.cs.purdue.edu
It's nothing fancy, just creates a B-Tree, transverses it in order and
searches it. It's quite fast but I'm sure if I tinkered with it I could
squeeze more out of it - any suggestions for improvement are welcome since
this will be used in a project of mine.Thanks!
Ryan
mcrm@cs.purdue.edu (don't use the address above - sorry, my goof but I can't
change it on this UNIX machine) 🙁
Posted by: mcrm <mcrm@...>
Since no one seemed to have code that shows using B-Trees, I made some of my
own. If anyone wants it, e-mail me PRIVATELY at mcrm@lore.cs.purdue.edu
It's nothing fancy, just creates a B-Tree, transverses it in order and
searches it. It's quite fast but I'm sure if I tinkered with it I could
squeeze more out of it - any suggestions for improvement are welcome since
this will be used in a project of mine.
own. If anyone wants it, e-mail me PRIVATELY at mcrm@lore.cs.purdue.edu
It's nothing fancy, just creates a B-Tree, transverses it in order and
searches it. It's quite fast but I'm sure if I tinkered with it I could
squeeze more out of it - any suggestions for improvement are welcome since
this will be used in a project of mine.
Thanks!
Ryan
mcrm@cs.purdue.edu (don't use the address above - sorry, my goof but I can't
change it on this UNIX machine) 🙁
Click for thumbs down.0Click for thumbs up.0