in reply to
Re^2: Learning the Deeper Secrets of Perl
in thread Learning the Deeper Secrets of Perl
One of the best online locations read up on general data structures and asymptotic time complexities would be the following URL
This document gives a really great overview of all the major CS data structures and it even gives a nice explenation of Time-Complexities without going too in depth (It gets confusing when you start calculating complexities of recursive algorithms )
Some of the pseudo-code and impelementations may be hard to understand, but what you cannot figure out based on this document you can definitely google. I was looking at the Linked-List explanation and I have defenitely seen better explanations before. There is no need to complicate such a simple concept...