| Titre : |
The design and analysis of computer algorithms |
| Type de document : |
texte imprimé |
| Auteurs : |
Alfred Aho, Auteur ; John E Hopcroft, Auteur ; Jeffrey D Ullman, Auteur |
| Editeur : |
London : Addison-Wesley |
| Année de publication : |
1974 |
| Importance : |
X- 470 p. |
| Présentation : |
ill. |
| Format : |
24 cm |
| ISBN/ISSN/EAN : |
978-0-201-00029-0 |
| Note générale : |
Bibliogr.-Index. |
| Langues : |
Anglais (eng) |
| Mots-clés : |
Computer algorithms
Electronic digital computers -- Programming
Ordinateurs -- Programmation
Algorithmes |
| Index. décimale : |
519.688 Programme et algorithmes pour la résolution informatique de problèmes spécifiques. |
| Résumé : |
With this text, you gain an understanding of the fundamental concepts of algorithms, the very heart of computer science. It introduces the basic data structures and programming techniques often used in efficient algorithms. Covers use of lists, push-down stacks, queues, trees, and graphs. Later chapters go into sorting, searching and graphing algorithms, the string-matching algorithms, and the Schonhage-Strassen integer-multiplication algorithm. Provides numerous graded exercises at the end of each chapter. |
| Note de contenu : |
Sommaire:
1. Models of computation
2. Design of efficient algorithms
3. Sorting and order statistics
4. Data structures for set mainipulation problems
5. Algorithms on graphs
... |
The design and analysis of computer algorithms [texte imprimé] / Alfred Aho, Auteur ; John E Hopcroft, Auteur ; Jeffrey D Ullman, Auteur . - London : Addison-Wesley, 1974 . - X- 470 p. : ill. ; 24 cm. ISBN : 978-0-201-00029-0 Bibliogr.-Index. Langues : Anglais ( eng)
| Mots-clés : |
Computer algorithms
Electronic digital computers -- Programming
Ordinateurs -- Programmation
Algorithmes |
| Index. décimale : |
519.688 Programme et algorithmes pour la résolution informatique de problèmes spécifiques. |
| Résumé : |
With this text, you gain an understanding of the fundamental concepts of algorithms, the very heart of computer science. It introduces the basic data structures and programming techniques often used in efficient algorithms. Covers use of lists, push-down stacks, queues, trees, and graphs. Later chapters go into sorting, searching and graphing algorithms, the string-matching algorithms, and the Schonhage-Strassen integer-multiplication algorithm. Provides numerous graded exercises at the end of each chapter. |
| Note de contenu : |
Sommaire:
1. Models of computation
2. Design of efficient algorithms
3. Sorting and order statistics
4. Data structures for set mainipulation problems
5. Algorithms on graphs
... |
|  |
The design and analysis of computer algorithms (1974)
