Re: [SLUG] Data structures

From: Russell Hires (rhires@earthlink.net)
Date: Tue Nov 12 2002 - 20:58:14 EST


-----BEGIN PGP SIGNED MESSAGE-----
Hash: SHA1

> This is kinda like showing you a picture of something and telling you
> it's a wrench. But without any further experience, it's not clear at all
> what a wrench is _for_, or why you should use one instead of your
> pliers (which look like they kinda do the same thing).

Yes! This is so true! Thanks for understanding my dilemma....<sigh of relief>

Maybe one day I'll put up a web page that explains what to do with this
stuff. There seems to be an intermediate step missing: it should go from data
structures, to why you'd use them, to algorithms. Or something like that.

I now will take this off list.

Russell

> A queue is kind of the reverse of a stack, because it's
> first-in-first-out, where a stack is last-in-first-out. Jason's
> example was a good one for a stack. Personally, I've never found the
> need to use a stack in a program. I know what they are, and I could
> probably code one from scratch if I needed to, but I just haven't found
> the need. A lot of data structures are that way-- worth knowing about,
> but you may never use them. But then the day comes where you're coding
> and you think, "I need something for this job... what would do this? A
> stack!"
>
> Paul

- --
Linux -- the OS for the Renaissance Man
-----BEGIN PGP SIGNATURE-----
Version: GnuPG v1.0.6 (GNU/Linux)
Comment: For info see http://www.gnupg.org

iD8DBQE90bG6AqKGrvVshJQRAqkMAKDwzikRJm8OJLdUg02il7+843Z1yQCfRr57
LSowIu7g9b4gIc9eLnJDJ4s=
=wTOd
-----END PGP SIGNATURE-----



This archive was generated by hypermail 2.1.3 : Fri Aug 01 2014 - 19:43:37 EDT