Mensys Online Shop

Algorithms in C, Third Edition - Part 1-4

Categorie:Algemeen - Boeken Van:Addison Wesley US
Meer informatie:www.awprofessional.c...Auteur(s):Robert Sedgewick
Bladzijden:702Publicatie-jaar:1997

Algorithms in C, Third Edition - Parts 1-4 represents the essential first half of Sedgewick's complete work.It provides extensive coverage of fundamental data structures & algorithms for sorting, searching, and related applications. The algorithms & data structures are expressed in concise implementations in C, so that you can both appreciate their fundamental properties and test them on real applications. Of course, the substance of the book applies to programming in any  » Lees meer...

Algorithms in C, Third Edition - Part 1-4

Selecteer een of meer artikelen en klik dan op Bestellen. Aantallen kunnen op de volgende blz. gewijzigd worden.
Partnr.OmschrijvingEuro *Euro incl. BTW 
C04638 Algorithms in C, Third Edition - Parts 1-468.7772.90

Alle prijzen zijn in Euro excl. BTW (19%, voor boeken 6%) en excl. verzendkosten.
E-mail of bel 023 548 20 20 voor licenties, upgrades en andere vragen.

Algorithms in C, Third Edition - Parts 1-4 represents the essential first half of Sedgewick's complete work.It provides extensive coverage of fundamental data structures & algorithms for sorting, searching, and related applications. The algorithms & data structures are expressed in concise implementations in C, so that you can both appreciate their fundamental properties and test them on real applications. Of course, the substance of the book applies to programming in any language.Highlights in Algorithms in C, Third Edition - Parts 1-4:- Expanded coverage of arrays, linked lists, strings, trees, & other basic data structures;- Greater emphasis on abstract data types (ADTs) than in previous editions;- 100+ algorithms for sorting, selection, priority queue ADT implementations, and symbol table ADT (searching) implementations;- New implementations of binomial queues, multiway radix sorting, Batcher's sorting networks, randomized BSTs, splay trees, skip lists, multiway tries, & more;- Increased quantitative information about the algorithms, including extensive empirical studies and basic analytic studies, giving you a basis for comparing them;- 1000+ new exercises to help you learn the properties of algorithms.Whether you are a student learning the algorithms for the first time or a professional interested in having up-to-date reference material, you will find a wealth of useful information in this book.