View Single Post
  #5   (View Single Post)  
Old 3rd November 2008
anemos's Avatar
anemos anemos is offline
Fdisk Soldier
 
Join Date: May 2008
Location: Ελλάδα
Posts: 53
Default

Quote:
Originally Posted by TerryP View Post
Lists, Stacks, and Queues are all similar enough that if you figure out how to implement one, the others should fall into place quick enough.
I don't think that data structures are very similar to each other in the way that each one is used into different cases. Data structures can be divided into two major categories, static (stack, queue, even an array is a data structure) and dynamic (linked-lists, trees, graphs) although someone can implement them statically (adjacency matrices for graphs etc). To my knowledge there are not many books that are language-centric because such a topic can be only "seen" algorithmicaly.

The difficult thing for someone when working with complex data structures is to design effective-efficient-reusable-as_fast_as_possible algorithms. The actual implementation/code is the easy part.

A book that I am aware of as great but haven't read it yet is Algorithms + Data Structures = Programs but i think that the algorithms are presented into pseudocode.

You can also have a look at /usr/include/sys/queue.h

Last edited by anemos; 3rd November 2008 at 11:53 AM.
Reply With Quote