McMillan, Michael Author
Biography not available.
Browse all ART CRITICISM books
Browse all Ashworth books
Browse all BUSINESS AND ECONOMICS books
Browse all FOLKLORE books
Browse all GARDENS books
Browse all GRAPHIC NOVELS books
Browse all HISTORY - MEDIEVAL books
Browse all HUMOUR books
Browse all Juvenile Fiction : Biographical - Other books
Browse all Juvenile Fiction : Historical - Other books
Browse all Juvenile Fiction : Legends, Myths, & Fables - Other books
Browse all Juvenile Fiction : People & Places - Other books
Browse all Juvenile Fiction : People & Places - United States - Other books
Browse all Juvenile Fiction : Religious - Other books
Browse all Juvenile Nonfiction : History - Other books
Browse all Juvenile Nonfiction : Mathematics - Advanced books
Browse all Juvenile Nonfiction : People & Places - Other books
Browse all Juvenile Nonfiction : People & Places - United States - Othe books
Browse all KINDRED books
Browse all LITERARY STUDIES books
Browse all LONDON books
Browse all Lozada books
Browse all Medical : Nursing - Mental Health books
Browse all MIND books
Browse all MUSEOLOGY books
Browse all NON-CLASSIFIABLE books
Browse all NONLINEAR SCIENCE books
Browse all POPULAR SCIENCE books
Browse all RELIGIOUS STUDIES books
Browse all SPIRIT books
Browse all SPORT books
Browse all TRAVEL WRITING books
Out of Stock
DATA STRUCTURES & ALGORITHMS U
Paperback ยท ISBN 9780521670159
Inclusive of GST and other taxes
Arriving at your doorstep in 10-15 days
Our logisitcs team will make sure everyitem is delivered safely
| ISBN | 9780521670159 |
|---|---|
| Subtitle | DATA STRUCTURES & ALGORITHMS U |
| Publisher | Cambridge University Press |
| Publication date | April 2007 |
| Language | English |
| MRP | ยฃ47.00 GBP |
| Page count | 368 |
| Item weight | 140 g |
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.
Log in to write a review for this book.
No reviews yet. Be the first to share your opinion.
Biography not available.