Mastering Algorithms with Perl: Practical Programming Through Computer ScienceMany programmers would love to use Perl for projects that involve heavy lifting, but miss the many traditional algorithms that textbooks teach for other languages. Computer scientists have identified many techniques that a wide range of programs need, such as:
|
Contents
Introduction | 1 |
Basic Data Structures | 25 |
Advanced Data Structures | 47 |
Sorting | 107 |
Searching | 165 |
Sets | 213 |
Matrices | 255 |
Graphs | 285 |
Number Theory | 521 |
Cryptography | 549 |
Probability | 589 |
Statistics | 623 |
Numerical Analysis | 651 |
Further Reading | 675 |
ASCII Character Set | 679 |
| 685 | |
Other editions - View all
Common terms and phrases
algorithm array binary search binary tree bit vectors bubble sort called Canidae Canines chapter character checksum compute CPAN create data structures decrypt defined delete distribution edges elsif encoding encryption epsilon example Figure Foreach function graph hash heap Here’s I/usr/bin/perl implementation input insert insertion sort integer intersection iteration linked list loop match Math::MatrixReal matrix mean mergesort method module move multiple node ofthe operations parsing password path pattern Perl Perl’s points position possible prime printF printF printF printF problem public key quicksort random recursion regular expressions result return undeF routine SarrayreF scalar Section sequence shiFt simple Slast sort sorting algorithms splice SSLeay string subroutine substr swaps technique topological sort undirected graph unless variable vertex vertices we’ll word zero