Bundle of algorithms in Java

Parts 1-5: Fundamentals, data structures, sorting, searching, and graph algorithms

Robert Sedgewick

1200 pages, parution le 14/08/2003

Ajouter à une liste

Indisponible

Résumé

Bundle of Algorithms in Java, Third Edition, Parts 1-5: Fundamentals, Data Structures, Sorting, Searching, and Graph Algorithms, 3/E

This is a shrink-wrapped bundle of Algorithms in Java, Third Edition, Parts 1-4 and Algorithms in Java, Third Edition, Part 5. The price of the bundle is $10 off the cost of buying the volumes individually.

All five parts are completely revamped, illuminating today's best algorithms for an exceptionally wide range of tasks. This bundle is suited for a comprehensive course, where the professor wants to cover fundamentals, data structures, sorting, searching, and graph algorithms in one consistent style. For detailed descriptions of each part of the bundle, please see the individual listing in this manual for Algorithms in Java, Third Edition, Parts 1-4, and Algorithms in Java, Part 5: Graph Algorithms. The long-awaited Java version of parts 1 through 5 of the most important work on computer algorithms, at a special discounted price!

The first two volumes of the long-awaited Java edition of Sedgewick's landmark work on Algorithms, bundled together with a special price.
Unique blend of theory and practice make these books appeal equally to both the professional and academic markets.
Over 400,000 copies of Sedgewick's books on algorithms have been sold!

Algorithms in Java, Parts 1-4

Fundamentals
- Introduction
- Principles of Algorithm Analysis
Data structures
- Elementary Data Structures
- Abstract Data Types
- Recursion and Trees

Sorting
- Elementary Sorting Methods
- Quicksort 315
- Merging and Mergesort
- Priority Queues and Heapsort
- Radix Sorting
- Special-Purpose Sorts

Searching
- Symbol Tables and BSTs
- Balanced Trees
- Hashing
- Radix Search
- External Searching

Appendix

Algorithms in Java, Part 5

Graph algorithms
- Graph Properties and Types
- Graph Search
- Digraphs and DAGs
- Minimum Spanning Trees
- Shortest Paths
- Network Flow

References for Part Five
Index

L'auteur - Robert Sedgewick

Robert Sedgewick , spécialiste des algorithmes mondialement reconnu, dirige le département d'informatique de l'université de Princeton.

Caractéristiques techniques

	PAPIER
Éditeur(s)	Addison Wesley
Auteur(s)	Robert Sedgewick
Parution	14/08/2003
Nb. de pages	1200
Format	19,5 x 23,5
Couverture	Broché
Poids	2100g
Intérieur	Noir et Blanc
EAN13	9780201775785