Data Structures and Algorithms Using C#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. |
Other editions - View all
Common terms and phrases
added algorithm application argument array ArrayList assign beginning binary search BitArray break build called capacity chapter characters child collection common Console.WriteLine constructor create CSet data set data structure definition deleted demonstrates determine discuss displayed edges efficient element examine example EXERCISES False FIGURE Finally for(int function graph hash table header Here’s implementation insert integer linked list look loop match method move node null object ofthe operations output path perform position problem provides public class public void queue regular expression remove represent result root shown simple solution sorting specified stack starting static void Main stored string StringBuilder successor System takes techniques traversal tree true vertex vertices write