Tous nos rayons

Déjà client ? Identifiez-vous

Mot de passe oublié ?

Nouveau client ?

CRÉER VOTRE COMPTE
Mastering algorithms with Perl
Ajouter à une liste

Librairie Eyrolles - Paris 5e
Indisponible

Mastering algorithms with Perl

Mastering algorithms with Perl

Jon Orwant, Jarkko Hietaniemi, John Mc Donald

704 pages, parution le 10/08/1999

Résumé

Many 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:
  • Fuzzy pattern matching for text (identify misspellings!)
  • Finding correlations in data
  • Game-playing algorithms
  • Predicting phenomena such as Web traffic
  • Polynomial and spline fitting
  • Encrypting your data

Using algorithms explained in this book, you too can carry out traditional programming tasks in a high-powered, efficient, easy-to-maintain manner with Perl.

This book assumes a basic understanding of Perl syntax and functions, but not necessarily any background in computer science. The authors explain in a readable fashion the reasons for using various classic programming techniques, the kind of applications that use them, and -- most important -- how to code these algorithms in Perl.

If you are an amateur programmer, this book will fill you in on the essential algorithms you need to solve problems like an expert.If you have already learned algorithms in other languages, you will be surprised at how much different (and often easier) it is to implement them in Perl. And yes, the book even has the obligatory fractal display program.

There have been dozens of books on programming algorithms, some of them excellent, but never before has there been one that uses Perl.

The authors include the editor of The Perl Journal and master librarian of CPAN; all are contributors to CPAN and have archived much of the code in this book there.

"This book was so exciting I lost sleep reading it." Tom Christiansen

Sommaire

Preface

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 Heaps Module 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 Inclusion Boundaries Closest Pair of Points Geometric Algorithms Summary CPAN Graphics Modules

Chapter 11. Number Systems Integers and Reals Strange Systems Trigonometry Significant Series

Chapter 12. Number Theory Basic Number Theory Prime Numbers Unsolved Problems

Chapter 13. Cryptography Legal Issues Authorizing People with Passwords Authorization of Data: Checksums and More Obscuring Data: Encryption Hiding Data: Steganography Winnowing and Chaffing Encrypted Perl Code Other Issues

Chapter 14. Probability Random Numbers Events Permutations and Combinations Probability Distributions Rolling Dice: Uniform Distributions Loaded Dice and Candy Colors: Nonuniform Discrete Distributions If the Blue Jays Score Six Runs: Conditional Probability Flipping Coins Over and Over: Infinite Discrete Distributions How Much Snow? Continuous Distributions Many More Distributions

Chapter 15. Statistics Statistical Measures Significance Tests Correlation

Chapter 16. Numerical Analysis Computing Derivatives and Integrals Solving Equations Interpolation, Extrapolation, and Curve Fitting

Appendix A. Further Reading

Appendix B. ASCII Character Set

Index

L'auteur - Jon Orwant

Jon Orwant, a well-known member of the Perl community, founded The Perl Journal and co-authored O'Reilly's bestseller, Programming Perl, 3rd Edition.

Caractéristiques techniques

  PAPIER
Éditeur(s) O'Reilly
Auteur(s) Jon Orwant, Jarkko Hietaniemi, John Mc Donald
Parution 10/08/1999
Nb. de pages 704
EAN13 9781565923980
ISBN13 978-1-56592-398-0

Avantages Eyrolles.com

Livraison à partir de 0,01 en France métropolitaine
Paiement en ligne SÉCURISÉ
Livraison dans le monde
Retour sous 15 jours
+ d'un million et demi de livres disponibles
satisfait ou remboursé
Satisfait ou remboursé
Paiement sécurisé
modes de paiement
Paiement à l'expédition
partout dans le monde
Livraison partout dans le monde
Service clients sav@commande.eyrolles.com
librairie française
Librairie française depuis 1925
Recevez nos newsletters
Vous serez régulièrement informé(e) de toutes nos actualités.
Inscription