Mastering Algorithms with Perl

Tell a friend

Mastering Algorithms with Perl By Jon Orwant, Jarkko Hietaniemi, John Macdonald
August 1999
Pages: 701

| Table of Contents | Index | Sample Chapter | Colophon

Chapter 1 Introduction
1. What Is an Algorithm?
2. Efficiency
3. Recurrent Themes in Algorithms
Chapter 2 Basic Data Structures
1. Perl's Built-in Data Structures
2. Build Your Own Data Structure
3. A Simple Example
4. Perl Arrays: Many Data Structures in One
Chapter 3 Advanced Data Structures
1. Linked Lists
2. Circular Linked Lists
3. Garbage Collection in Perl
4. Doubly-Linked Lists
5. Infinite Lists
6. The Cost of Traversal
7. Binary Trees
8. Heaps
9. Binary Heaps
10. Janus Heap
11. The Heap Modules
12. Future CPAN Modules
Chapter 4 Sorting
1. An Introduction to Sorting
2. All Sorts of Sorts
3. Sorting Algorithms Summary
Chapter 5 Searching
1. Hash Search and Other Non-Searches
2. Lookup Searches
3. Generative Searches
Chapter 6 Sets
1. Venn Diagrams
2. Creating Sets
3. Set Union and Intersection
4. Set Differences
5. Counting Set Elements
6. Set Relations
7. The Set Modules of CPAN
8. Sets of Sets
9. Multivalued Sets
10. Sets Summary
Chapter 7 Matrices
1. Creating Matrices
2. Manipulating Individual Elements
3. Finding the Dimensions of a Matrix
4. Displaying Matrices
5. Adding or Multiplying Constants
6. Transposing a Matrix
7. Multiplying Matrices
8. Extracting a Submatrix
9. Combining Matrices
10. Inverting a Matrix
11. Computing the Determinant
12. Gaussian Elimination
13. Eigenvalues and Eigenvectors
14. The Matrix Chain Product
15. Delving Deeper
Chapter 8 Graphs
1. Vertices and Edges
2. Derived Graphs
3. Graph Attributes
4. Graph Representation in Computers
5. Graph Traversal
6. Paths and Bridges
7. Graph Biology: Trees, Forests, DAGS, Ancestors, and Descendants
8. Edge and Graph Classes
9. CPAN Graph Modules
Chapter 9 Strings
1. Perl Builtins
2. String-Matching Algorithms
3. Phonetic Algorithms
4. Stemming and Inflection
5. Parsing
6. Compression
Chapter 10 Geometric Algorithms
1. Distance
2. Area, Perimeter, and Volume
3. Direction
4. Intersection
5. Inclusion
6. Boundaries
7. Closest Pair of Points
8. Geometric Algorithms Summary
9. CPAN Graphics Modules
Chapter 11 Number Systems
1. Integers and Reals
2. Strange Systems
3. Trigonometry
4. Significant Series
Chapter 12 Number Theory
1. Basic Number Theory
2. Prime Numbers
3. Unsolved Problems
Chapter 13 Cryptography
1. Legal Issues
2. Authorizing People with Passwords
3. Authorization of Data: Checksums and More
4. Obscuring Data: Encryption
5. Hiding Data: Steganography
6. Winnowing and Chaffing
7. Encrypted Perl Code
8. Other Issues
Chapter 14 Probability
1. Random Numbers
2. Events
3. Permutations and Combinations
4. Probability Distributions
5. Rolling Dice: Uniform Distributions
6. Loaded Dice and Candy Colors: Nonuniform Discrete Distributions
7. If the Blue Jays Score Six Runs: Conditional Probability
8. Flipping Coins Over and Over: Infinite Discrete Distributions
9. How Much Snow? Continuous Distributions
10. Many More Distributions
Chapter 15 Statistics
1. Statistical Measures
2. Significance Tests
3. Correlation
Chapter 16 Numerical Analysis
1. Computing Derivatives and Integrals
2. Solving Equations
3. Interpolation, Extrapolation, and Curve Fitting

Appendix A Further Reading
1. General References for Algorithms
2. Graphs, Graphics, and Geometry
3. String Processing and Parsing
4. Numerical Methods
5. General Mathematics
6. Probability and Statistics
7. Other References
Appendix B ASCII Character Set
Colophon

Return to Mastering Algorithms with Perl

Table of Contents

Chapter 1 Introduction

What Is an Algorithm?

Efficiency

Recurrent Themes in Algorithms

Chapter 2 Basic Data Structures

Perl's Built-in Data Structures

Build Your Own Data Structure

A Simple Example

Perl Arrays: Many Data Structures in One

Chapter 3 Advanced Data Structures

Linked Lists

Circular Linked Lists

Garbage Collection in Perl

Doubly-Linked Lists

Infinite Lists

The Cost of Traversal

Binary Trees

Heaps

Binary Heaps

Janus Heap

The Heap Modules

Future CPAN Modules

Chapter 4 Sorting

An Introduction to Sorting

All Sorts of Sorts

Sorting Algorithms Summary

Chapter 5 Searching

Hash Search and Other Non-Searches

Lookup Searches

Generative Searches

Chapter 6 Sets

Venn Diagrams

Creating Sets

Set Union and Intersection

Set Differences

Counting Set Elements

Set Relations

The Set Modules of CPAN

Sets of Sets

Multivalued Sets

Sets Summary

Chapter 7 Matrices

Creating Matrices

Manipulating Individual Elements

Finding the Dimensions of a Matrix

Displaying Matrices

Adding or Multiplying Constants

Transposing a Matrix

Multiplying Matrices

Extracting a Submatrix

Combining Matrices

Inverting a Matrix

Computing the Determinant

Gaussian Elimination

Eigenvalues and Eigenvectors

The Matrix Chain Product

Delving Deeper

Chapter 8 Graphs

Vertices and Edges

Derived Graphs

Graph Attributes

Graph Representation in Computers

Graph Traversal

Paths and Bridges

Graph Biology: Trees, Forests, DAGS, Ancestors, and Descendants

Edge and Graph Classes

CPAN Graph Modules

Chapter 9 Strings

Perl Builtins

String-Matching Algorithms

Phonetic Algorithms

Stemming and Inflection

Parsing

Compression

Chapter 10 Geometric Algorithms

Distance

Area, Perimeter, and Volume

Direction

Intersection