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

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

http://en.wikibooks.org/wiki/Programming:Data_Structures

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?
Username:
Password:

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://426680]
help
Chatterbox?
[oiskuu]: Someone needs to re-read How do I use the power of consideration responsibly? carefully. Consideration is not intended for stamping out humor, AFAIK.
[oiskuu]: E.g. Re^3: Big thank you to the Perl community. is surely dry humor (not mine). Don't they teach humor in german schools!?

How do I use this? | Other CB clients
Other Users?
Others perusing the Monastery: (10)
As of 2017-04-27 19:46 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?
    I'm a fool:











    Results (512 votes). Check out past polls.