Skip to main content Accessibility help
×
  • Cited by 4
    • Show more authors
    • You may already have access via personal or institutional login
    • Select format
    • Publisher:
      Cambridge University Press
      Publication date:
      June 2012
      March 2007
      ISBN:
      9780511804793
      9780521876919
      9780521670159
      Dimensions:
      (242 x 185 mm)
      Weight & Pages:
      0.736kg, 366 Pages
      Dimensions:
      (253 x 177 mm)
      Weight & Pages:
      0.63kg, 368 Pages
    You may already have access via personal or institutional login
  • Selected: Digital
    Add to cart View cart Buy from Cambridge.org

    Book description

    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.

    Reviews

    "An excellent, thoroughly enjoyable work on introductory and intermediate data structures for the increasingly popular C# programming language.... This book is valuable for any data structures course."-- M Connell, SUNY College at Cortland, CHOICE

    Refine List

    Actions for selected content:

    Select all | Deselect all
    • View selected items
    • Export citations
    • Download PDF (zip)
    • Save to Kindle
    • Save to Dropbox
    • Save to Google Drive

    Save Search

    You can save your searches here and later view and run them again in "My saved searches".

    Please provide a title, maximum of 40 characters.
    ×

    Contents

    References
    Cormen, Thomas H., Leiserson, Charles E., Rivest, Ronald L., and Stein, Clifford. Introduction to Algorithms. Cambridge, MA: The MIT Press, 2001.
    Ford, William and Topp, William. Data Structures with C++. Upper Saddle River, NJ: Prentice Hall, 1996.
    Friedel, Jeffrey E. F. Mastering Regular Expressions, Sebastopol, CA: O'Reilly and Associates, 1997.
    LaFore, Robert. Data Structures and Algorithms in Java, Corte Madera, CA: Waite Group Press, 1998.
    McMillan, Michael. Object-Oriented Programming With Visual Basic.NET, New York: Cambridge University Press, 2004.
    Sedgewick, Robert. Algorithms in C, Reading, MA: Addison-Wesley, 1998.
    Weiss, Mark Allen. Data Structures and Algorithm Analysis in Java, Reading, MA: Addison-Wesley, 1999.

    Metrics

    Altmetric attention score

    Full text views

    Total number of HTML views: 0
    Total number of PDF views: 0 *
    Loading metrics...

    Book summary page views

    Total views: 0 *
    Loading metrics...

    * Views captured on Cambridge Core between #date#. This data will be updated every 24 hours.

    Usage data cannot currently be displayed.

    Accessibility standard: Unknown

    Why this information is here

    This section outlines the accessibility features of this content - including support for screen readers, full keyboard navigation and high-contrast display options. This may not be relevant for you.

    Accessibility Information

    Accessibility compliance for the PDF of this book is currently unknown and may be updated in the future.