BIBLIO is the largest independent book marketplace in the world, with over 100 million books.

Skip to content

Data Structures and Algorithms Using C#

Data Structures and Algorithms Using C#

Data Structures and Algorithms Using C#
Stock photo: cover may vary

Data Structures and Algorithms Using C# Paperback - 2007

by McMillan, Michael

Add to wish list
  • Used
  • very good
  • Paperback
Used - Very good

Description

Cambridge University Press, 2007-04-26. Paperback. Very Good. 8x7x0. Very good paperback copy, from a personal collection (NOT ex-library). A reprint copy (maybe a print-on-demand?). Remainder mark on bottom edge. Spine is uncreased, binding tight and sturdy; text also very good. Exterior looks nice. Ships from Dinkytown in Minneapolis, Minnesota. Due to the size/weight of this book extra charges may apply for international shipping.
Ask the seller a question Add to wish list
A$27.11
A$8.80 Delivery within USA
Standard delivery: 4 to 12 days
More delivery options
Ships from The Book House in Dinkytown (Minnesota, United States)
Biblio Top Seller
The BIBLIO Guarantee

Details

  • Title Data Structures and Algorithms Using C#
  • Author McMillan, Michael
  • Binding Paperback
  • Edition INTERNATIONAL ED
  • Condition Used - Very good
  • Pages 368
  • Volumes 1
  • Language ENG
  • Publisher Cambridge University Press
  • Publication date 2007-04-26
  • Illustrated Yes
  • Features Bibliography, Illustrated, Index, Table of Contents
  • Bookseller's Inventory # 291181
  • ISBN 9780521670159 / 0521670152
  • Weight 1.45 lbs (0.66 kg)
  • Dimensions 9.2 x 7.5 x 0.9 in (23.37 x 19.05 x 2.29 cm)
  • Size 8x7x0
  • Category Computers - Languages / Programming
  • Library of Congress subjects C (Computer program language)
  • Library of Congress Catalogue Number 2006024382
  • Dewey Decimal Code 005.276
  • Quantity available 1
  • Bookseller catalogues Computers/Electronics

About The Book House in Dinkytown Minnesota, United States

Specialising in: Academic & Scholarly, Classics, Modern First Editions, Philosophy, Rare, Used
Biblio member since 2015

Used books bought and sold, classics and collectibles in all fields. In Dinkytown since 1976.

Terms of Sale:

30 day return guarantee, with full refund including original shipping costs for up to 30 days after delivery if an item arrives misdescribed or damaged.

Browse books from The Book House in Dinkytown

Reader reviews for Data Structures and Algorithms Using C#

Write a review for this book

There are no reviews for this book yet. Be the first to write a review!

Your review will be anonymous unless you login or create an account first.

Overall rating
Remember: You’re rating the book as a work, not the seller or the condition of the specific copy you purchased!

Important Terms and Guidelines

  • Please focus on the book’s content and context. Also, add any personal comments as to how you enjoyed the book. Substantiate your likes and dislikes. You may make comparisons to other books.
  • Reviews must be at least 140 characters in length.
  • Please do not reveal critical plot elements.
  • This is not a help line. Contact customer support if you need help.
Your review must not include:
  • Obscenities, discriminatory language, or other insulting language not suitable for public domain
  • Advertisements, “spam” content, or references to other products, offers or websites.
  • Email addresses, URLs, phone numbers, physical addresses or other contact information.
  • Overly critical comments about other reviews or reviewers
  • Time-sensitive material (i.e. promotional tours, seminars, lectures, etc.)
  • Availability, price, or alternative ordering/shipping information

From the publisher

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.

Please wait a moment while we load the requested page.

tracking-