Data structures and algorithms using C#

Select an Action

Title:

Author:

McMillan, Michael, 1957-

ISBN:

9780521670159

9780521876919

Personal Author:

McMillan, Michael, 1957-

Publication Information:

Cambridge ; New York : Cambridge University Press, 2007.

Physical Description:

x, 355 p. : ill. ; 24 cm.

General Note:

Formerly CIP.

Contents:

Ch. 1. An introduction to collections, generics, and the timing class -- Ch. 2. Arrays and ArrayLists -- Ch. 3. Basic sorting algorithms -- Ch. 4. Basic searching algorithms -- Ch. 5. Stacks and queues -- Ch. 6. The BitArray class -- Ch. 7. Strings, the string class, and the StringBuilder class -- Ch. 8. Pattern matching and text processing -- Ch. 9. Building dictionaries the DictionaryBase class and the SortedList class -- Ch. 10. Hashing and the hashtable class -- Ch. 11. Linked lists -- Ch. 12. Binary trees and binary search trees -- Ch. 13. Sets -- Ch. 14. Advanced sorting algorithms -- Ch. 15. Advanced data structures and algorithms for searching -- Ch. 16. Graphs and graph algorithms -- Ch. 17. Advanced algorithms.

Subject Term:

C# (Computer program language)

Electronic Access:

Table of contents only http://www.loc.gov/catdir/toc/ecip0618/2006024382.html
Publisher description http://www.loc.gov/catdir/enhancements/fy0702/2006024382-d.html
Contributor biographical information http://www.loc.gov/catdir/enhancements/fy0729/2006024382-b.html

Copies:

Available:*

Library	Material Type	Item Barcode	Shelf Number	Copy	Status
Searching... 1:IIEMSA	1:GEN-BOOK	33168025403151	005.133 C111.1 MAC 2007	1	Searching... Unknown

Bound With These Titles

On Order

Summary

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.