Data Structures and Algorithms Using C#
Cambridge University Press (Verlag)
978-0-521-87691-9 (ISBN)
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.
Michael McMillan is an Instructor of Computer Information Systems at Pulaski Technical College, as well as an adjunct instructor at the University of Arkansas at Little Rock and the University of Central Arkansas. Mike's previous books include Object-Oriented Programming With Visual Basic.NET, Data Structures and Algorithms Using Visual Basic.NET, and Perl From the Ground Up. He was a co-author of Programming and Problem-Solving With Visual Basic.NET. Mike has written over 25 trade journal articles on programming and has over 20 years of experience in programming for industry and education.
Preliminaries; 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.
| Erscheint lt. Verlag | 26.3.2007 |
|---|---|
| Zusatzinfo | Worked examples or Exercises; 11 Tables, unspecified |
| Verlagsort | Cambridge |
| Sprache | englisch |
| Maße | 185 x 242 mm |
| Gewicht | 736 g |
| Themenwelt | Mathematik / Informatik ► Informatik ► Programmiersprachen / -werkzeuge |
| Informatik ► Theorie / Studium ► Algorithmen | |
| ISBN-10 | 0-521-87691-5 / 0521876915 |
| ISBN-13 | 978-0-521-87691-9 / 9780521876919 |
| Zustand | Neuware |
| Haben Sie eine Frage zum Produkt? |
aus dem Bereich
