Algorithms in C, Parts 1-5 (Bundle): Fundamentals, Data Structures, Sorting, Searching, and Graph Algorithms

Robert Sedgewick

Anno: 2001
Rilegatura: Paperback / softback
Pagine: 1200 p.
Testo in English
Dimensioni: 230 x 200 mm
Peso: 2243 gr.
  • EAN: 9780201756081
pagabile con 18App pagabile con Carta del Docente

Articolo acquistabile con 18App e Carta del Docente

€ 102,56

€ 106,83

Risparmi € 4,27 (4%)

Venduto e spedito da IBS

103 punti Premium

Disponibile in 4/5 settimane

Quantità:
Descrizione
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.