Algorithms In C. Parts 1-4 : Fundamentals Data Structures Sorting Searching: Fundamentals, Data Structures, Sorting, Searching, and Graph Algorithms (Bundle) - Tapa blanda

Sedgewick, Robert

9780201756081: Algorithms In C. Parts 1-4 : Fundamentals Data Structures Sorting Searching: Fundamentals, Data Structures, Sorting, Searching, and Graph Algorithms (Bundle)

Tapa blanda

ISBN 10: 0201756080 ISBN 13: 9780201756081

Editorial: Addison Wesley, 2000

Ver todas las copias de esta edici�n del ISBN

1 Usado

De EUR 657,00

3 Nuevo

De EUR 160,45

Book by Sedgewick Robert

"Sinopsis" puede pertenecer a otra edici�n de este libro.

Rese�a del editor

Software developers and computer scientists have eagerly awaited this comprehensive revision of Robert Sedgewick's landmark texts on algorithms. 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. Together, these books are definitive: the most up-to-date and practical algorithms resource available. Sedgewick masterfully blends theory and practice, making Bundle of Algorithms in C, Third Edition an essential resource for computer science researchers, students, and working developers alike. 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. Together, these books present nearly 2,000 new exercises, hundreds of new figures, and dozens of new programs. In both books, 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.

Contraportada

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.

0201756080B07112001

"Sobre este t�tulo" puede pertenecer a otra edici�n de este libro.