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 array and ArrayLists, 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.
This book is written primarily as a practical overview of the data structures and algorithms all serious computer programmers need to know and understand. Given this, there is no formal analysis of the data structures and algorithms covered in the book. Hence, there is not a single mathematical formula and not one mention of Big Oh analysis (if you don’t know what this means, look at any of the books mentioned in the bibliography). Instead, the various data structures and algorithms are presented as problem-solving tools. Simple timing tests are used to compare the performance of the data structures and algorithms discussed in the book.
The only prerequisite for this book is that the reader have some familiarity with the C# language in general, and object-oriented programming in C# in particular.
TABLE OF CONTENT:
Chapter 01 – An Introduction to Collections, Generics, and the Timing Class
Chapter 02 – Arrays and ArrayLists
Chapter 03 – Basic Sorting Algorithms
Chapter 04 – Basic Searching Algorithms
Chapter 05 – Stacks and Queues
Chapter 06 – The BitArray Class
Chapter 07 – Strings, the String Class, and the StringBuilder Class
Chapter 08 – Pattern Matching and Text Processing
Chapter 09 – Building Dictionarie
Chapter 10 – Hashing and the Hashtable Class
Chapter 11 – Linked Lists
Chapter 12 – Binary Trees and Binary Search Trees
Chapter 13 – Sets
Chapter 14 – Advanced Sorting Algorithms
Chapter 15 – Advanced Data Structures and Algorithms for Searching
Chapter 16 – Graphs and Graph Algorithms
Chapter 17 – Advanced Algorithms
Download
Password default : wpspot.info
