Mensys Online Shop
| Categorie: | Algemeen - Boeken | Van: | Cambridge University Press |
| Meer informatie: | www.cambridge.org | Info-file: | big_front_DataStruct... |
| Auteur(s): | Michael McMillan | Bladzijden: | 355 |
| Publicatie-jaar: | 2007 | ||
The approach is very practical, using timing tests rather than Big O notation to analyze the efficiency of an approach. Coverage includes arrays and array lists, linked lists, hash tables, dictionaries, trees, graphs, and sorting and searching algorithms, as well as more advanced algorithms such as probabilistic algorithms and dynamic programming.This is the perfect resource for C# professionals and students alike.- New - first C# book on implementing data structures and algorithms from the » Lees meer... |  |
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.
The approach is very practical, using timing tests rather than Big O notation to analyze the efficiency of an approach. Coverage includes arrays and array lists, linked lists, hash tables, dictionaries, trees, graphs, and sorting and searching algorithms, as well as more advanced algorithms such as probabilistic algorithms and dynamic programming.This is the perfect resource for C# professionals and students alike.- New - first C# book on implementing data structures and algorithms from the .NET framework;- Comprehensive - includes basic data structures & algorithms plus advanced algorithms such as probabilistic algorithms & dynamics programming;- Practical - features an approach to efficiency analysis that's useful for the working programmer.