--ben "ubergeek" doom
Candace Cottrell wrote:
> *trickles of blood coming out of Candace's mouth and nose*
>
> Candace K. Cottrell, Web Developer
> The Children's Medical Center
> One Children's Plaza
> Dayton, OH 45404
> 937-641-4293
>
> http://www.childrensdayton.org
> [EMAIL PROTECTED]
>
> "There is no right price for the wrong product, even if it is
> inexpensive and delivered on time."
>
> >>> [EMAIL PROTECTED] 3/29/2004 3:40:24 PM >>>
>
> I know that somewhere in my pile of overpriced texts I've got something
> good on the subject. If I can find it tonight, I'll let you know.
>
> Basically, though, there are a few "first principles" that, once
> learned, apply to pretty much anything.
>
> For example, once you have a good grasp of the basics of linked lists
> and arrays and how each is (or can be) indexed, you can figure out how
> to make queues and stacks from each. Similarly, once you understand
> about hash tables and trees, you can do an informal analysis of lookup
> and insertion effeciency vs. memory efficiency in each.
>
> But, then, I'm an incredibly geeky guy, so this was fun and games for
> me.... YMMV.
>
> --benD
>
> Deanna Schneider wrote:
>
> > So, all you folks that have done the online college thing, have any
> of you
> > come across an excellent class on data structures? Not data models. Not
> > databases, but data structures -
> > An organization of information, usually in memory, for better algorithm
> > efficiency, such as queue, stack, linked list, heap, dictionary, and
> tree,
> > or conceptual unity, such as the name and address of a person. It may
> > include redundant information, such as length of the list or number
> of nodes
> > in a subtree.
> >
> > My boss thinks it might be beneficial for me to learn more about these
> > beasties, and he's willing to pay for a college course to do it. Mmmmmm.
> >
> > -d
>
[Todays Threads] [This Message] [Subscription] [Fast Unsubscribe] [User Settings]
