Beefy Boxes and Bandwidth Generously Provided by pair Networks
Perl Monk, Perl Meditation

Re^3: Learning the Deeper Secrets of Perl

by Anonymous Monk
on Jan 31, 2005 at 18:03 UTC ( #426680=note: print w/ replies, xml ) Need Help??

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...

Good luck!

Comment on Re^3: Learning the Deeper Secrets of Perl

Log In?

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://426680]
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others rifling through the Monastery: (4)
As of 2015-10-04 23:49 GMT
Find Nodes?
    Voting Booth?

    Does Humor Belong in Programming?

    Results (105 votes), past polls