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.Read more
- Was the first C# book on implementing data structures and algorithms from the .NET framework
- Includes basic data structures and algorithms plus advanced algorithms such as probabilistic algorithms and dynamics programming
- Features an approach to efficiency analysis that's useful for the working programmer
Review was not posted due to profanity×
- Date Published: April 2007
- format: Hardback
- isbn: 9780521876919
- length: 366 pages
- dimensions: 254 x 178 x 21 mm
- weight: 0.85kg
- contains: 11 tables 67 exercises
- availability: Available
Table of Contents
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
14. Advanced sorting algorithms
15. Advanced data structures and algorithms for searching
16. Graphs and graph algorithms
17. Advanced algorithms.
Find resources associated with this titleYour search for '' returned .
Type Name Unlocked * Format Size
This title is supported by one or more locked resources. Access to locked resources is granted exclusively by Cambridge University Press to lecturers whose faculty status has been verified. To gain access to locked resources, lecturers should sign in to or register for a Cambridge user account.
Please use locked resources responsibly and exercise your professional discretion when choosing how you share these materials with your students. Other lecturers may wish to use locked resources for assessment purposes and their usefulness is undermined when the source files (for example, solution manuals or test banks) are shared online or via social networks.
Supplementary resources are subject to copyright. Lecturers are permitted to view, print or download these resources for use in their teaching, but may not change them or use them for commercial gain.
If you are having problems accessing these resources please contact email@example.com.
Sorry, this resource is locked
Please register or sign in to request access. If you are having problems accessing these resources please email firstname.lastname@example.orgRegister Sign in