quoth the Martin DeMello:

> What would be a nice approach is a tour of the fundamental
> data structures, each one accompanied by an algorithm that it forms
> the core of, and a full implementation in ruby. 

He does include code in Ruby, though oddly, it is not presented inline, nor 
even linked inline:

http://www.brpreiss.com/books/opus8/programs/index.html

> If this were aimed at 
> working programmers looking at going back and catching up on CS
> fundamentals, the examples could be one level above the usual toys -
> for instance:
>
> stack -> infix arithmetic expression parser
> queue -> bitmap floodfill
> linked list -> trivial memory allocator and compactor
> heap -> priority queue
> etc.
>
> martin

-d
-- 
darren kirby :: Part of the problem since 1976 :: http://badcomputer.org
"...the number of UNIX installations has grown to 10, with more expected..."
- Dennis Ritchie and Ken Thompson, June 1972