ShopSpell

Data Structures and Algorithms Using C [Hardcover]

$162.99       (Free Shipping)
69 available
  • Category: Books (Computers)
  • Author:  McMillan, Michael
  • Author:  McMillan, Michael
  • ISBN-10:  0521876915
  • ISBN-10:  0521876915
  • ISBN-13:  9780521876919
  • ISBN-13:  9780521876919
  • Publisher:  Cambridge University Press
  • Publisher:  Cambridge University Press
  • Pages:  366
  • Pages:  366
  • Binding:  Hardcover
  • Binding:  Hardcover
  • Pub Date:  01-May-2007
  • Pub Date:  01-May-2007
  • SKU:  0521876915-11-MPOD
  • SKU:  0521876915-11-MPOD
  • Item ID: 100752741
  • Seller: ShopSpell
  • Ships in: 2 business days
  • Transit time: Up to 5 business days
  • Delivery by: Apr 08 to Apr 10
  • Notes: Brand New Book. Order Now.
First comprehensive tutorial and reference for C# implementation of data structures and algorithms.The first comprehensive tutorial and reference for C# implementation of data structures and algorithms found in the .NET Framework library, in addition to those developed by the programmer. Coverage includes arrays and array lists, linked lists, hash tables, dictionaries, trees, graphs, sorting and searching algorithms, probabilistic algorithms and dynamic programming.The first comprehensive tutorial and reference for C# implementation of data structures and algorithms found in the .NET Framework library, in addition to those developed by the programmer. Coverage includes arrays and array lists, linked lists, hash tables, dictionaries, trees, graphs, sorting and searching algorithms, probabilistic algorithms and dynamic programming.C# programmers: no more translating data structures from C++ or Java to use in your programs! Mike McMillan provides a tutorial on how to use data structures and algorithms plus the first comprehensive reference for C# implementation of data structures and algorithms found in the .NET Framework library, as well as those developed by the programmer. 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.Preliminaries; 1. Collections; 2. Arrays and arraylists; 3. Basic sorting algorithms; 4. Basic searching algorithms; 5. Stacks and queues; 6. The bitarray class; 7. Strings, the string class and the stringbuilder class; 8. Pattern matching and text processing; 9. Building dictionaries - the dictionarybase class and the sortedlist class; 10. Hashing and the hashtable class; 11. Linked lƒ.
Add Review