Mastering Algorithms with Perl

eBook Details

Author:John Macdonald, Jon Orwant, and Jarkko Hietaniemi
No of Pages: 701 pages
Press: O'Reilly Media;
Edition:1st edition
Dated:August 18, 1999
Language: English
ISBN-10: 1565923987
ISBN-13: 978-1565923980

eBook Description
Written for readers with at least some Perl programming experience, Mastering Algorithms in Perl delivers a solid library of algorithms written in Perl for business and mathematical computing. From data structures to cryptography and more advanced mathematical algorithms, this book provides a worthwhile guide to extending Perl's coding capabilities.

The best thing about Mastering Algorithms in Perl is the scope at which it covers the universe of algorithms while refraining from getting bogged down in academic detail. Besides basic data structures--a lynchpin of books on algorithms--the authors provide dozens and dozens of algorithms for sorting, searching, and doing mathematical computations of all kinds. While they discuss "Big-O" notation and assume a general familiarity with math, they don't overwhelm the reader. (You can even borrow the code without needing a math degree to understand it.) The focus is on efficient, reusable Perl subroutines written and compiled by three Perl experts.

Standout chapters include extending Perl's already powerful string processing abilities, game programming, and cryptography. Generally, the authors achieve a good mix of more advanced (and less well-known) algorithms, along with the basics. Chances are you won't need to use all the dozen or so sorting algorithms presented here, but the authors include them all, just in case. As a reference and tutorial, readers can pick and choose what they need for real-world Perl development.
Keywords
Schwartzian Transform, Sula Center, Wolfbane Corners, World Wide Web, Graph Classes, Numerical Recipes, Recurrent Themes, Graph Biology, Mark Jason Dominus, Paul Marquess, Solving Equations, Authorizing People, East Prussia, Efficiency Tip, Eric Young, Gabriel's Horn, Obscuring Data, Pentium Pro, Ron Rivest, Vanilla Flats, Very Big, Floyd Warshall,naïve matcher, wallclock secs, return undef, sub literal, proportional search, anonymous hash, constant epsilon, transpose table, module bundled, advanced data structures, hash reference, prefix function, print round, sub error, tail pointer, return sqrt, odd median, heap order, sink vertex, binary heap, radix sort, sorting routine, use integer, successor vertex, insertion sort.

Download Links
http://rapidshare.com/files/257693118/O_Reilly_-_Mastering_Algorithms_with_Perl.pdf