Algorithms in C

Part 1-4 : fundamentals, data stuctures, sorting, searching. Part 5: graph algorithms.

Robert Sedgewick

1184 pages, parution le 04/12/2001 (3^eme édition)

Ajouter à une liste

Indisponible

Résumé

Software developers and computer scientists have eagerly awaited this comprehensive revision of Robert Sedgewick's landmark texts on algorithms for C. Sedgewick has completely revamped all five sections, illuminating today's best algorithms for an exceptionally wide range of tasks. This shrink-wrapped package brings together Algorithms in C, Third Edition, Parts 1-4 and his new Algorithms in C, Third Edition, Part 5, at a special discounted price. Together, these books are the most definitive, up-to-date, and practical algorithms resource available. The first book introduces fundamental concepts associated with algorithms, then covers data structures, sorting, and searching. The second book focuses entirely on graphing algorithms, which are critical for a wide range of applications, including network connectivity, circuit design, scheduling, transaction processing, and resource allocation. Sedgewick focuses on practical applications, giving readers all the information, diagrams, and real (not pseudo-) code they need to confidently implement, debug, and use the algorithms he presents. Together these books present nearly 2,000 new exercises, hundreds of new figures, and dozens of new programs.

Contents

Fundamentals

Introduction
Principles of Algorithm Analysis

Data Structures

Elementary Data Structures
Abstract Data Types
Recursion and Trees

Sorting

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

Searching

Symbol Tables and BSTs
Balanced Trees
Hasling
Radix Search
External Searching
Index

Graph Algoritms

Graph Properties and Types
Graph Search
Disgraphs and DAGs
Minimum Spanning Trees
Shortest Paths
Network Flows
References
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	04/12/2001
Édition	3^eme édition
Nb. de pages	1184
Format	19,4 x 23,4
Couverture	Broché
Poids	1900g
Intérieur	Noir et Blanc
EAN13	9780201756081
ISBN13	978-0-201-75608-1