There are very few Perl books that focus on algorithms and data structures
because a lower level language, such as C++, tends to be better suited to that. To illustrate, you rarely write your own linked list or sorting algorithm in Perl; you tend to use built-in language features or CPAN modules for those sorts of tasks.
In fact, the only Perl books I can think of that offer much
in that regard are:
As for general advice on Perl books and how to learn Perl, there is
no shortage of advice on those topics at Perl Monks.
| [reply] |
It's not a Perl book (it dates from before Perl was invented) but I strongly recommend:
Algorithms + Data Structures = Programs, Niklaus Wirth, Prentice Hall, 1976, ISBN 0-13-022418-9
Regards,
John Davies
| [reply] |
I think that this is a newer edition of my goto book on algorithms. Unfortunately, I cannot verify it at the moment, since it is sitting on my office shelf at home.
There is also the classic The Art of Computer Programming by Knuth, but that might be a bit heady.
| [reply] |
I am not sure if you want info on how to design algorithms and data structures or how to code those design in perl. Other responders have concentrated on the design. For coding details, most of us would benefit from an occasional review of perl's own documentation. Use perl's tool perldoc to read the following pages:
perldata, perlref, perlreftut, perldsc, perllol.
| [reply] |