Data structures and algorithms using C? /
Michael McMillan.
- Cambridge ; New York : Cambridge University Press, 2007.
- x, 355 p. : ill. ; 24 cm.
Includes bibliographical references (p. 339) and index.
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 lists -- 12. Binary trees and binary search trees -- 13. Sets -- 14. Advanced sorting algorithms -- 15. Advanced data structures and algorithms for searching -- 16. Graphs and graph algorithms -- 17. Advanced algorithms.
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.