Data Structures Algorithms Using by Michael Mcmillan (49 results)

Paperback. Condition: Good. Connecting readers with great books since 1972! Used textbooks may not include companion materials such as access codes, etc. May have some wear or writing/highlighting. We ship orders daily and Customer Service is our top priority.

Paperback. Condition: Fair. No Jacket. Readable copy. Pages may have considerable notes/highlighting. ~ ThriftBooks: Read More, Spend Less.

Paperback. Condition: Good. No Jacket. Pages can have notes/highlighting. Spine may show signs of wear. ~ ThriftBooks: Read More, Spend Less.

Condition: Fine. Used book that is in almost brand-new condition. May contain a remainder mark. Better World Books: Buy Books. Do Good.

Condition: Good. Pages intact with minimal writing/highlighting. The binding may be loose and creased. Dust jackets/supplements are not included. Stock photo provided. Product includes identifying sticker. Better World Books: Buy Books. Do Good.

Condition: Good. Former library copy. Pages intact with minimal writing/highlighting. The binding may be loose and creased. Dust jackets/supplements are not included. Includes library markings. Stock photo provided. Product includes identifying sticker. Better World Books: Buy Books. Do Good.

Condition: Good. Former library copy. Pages intact with minimal writing/highlighting. The binding may be loose and creased. Dust jackets/supplements are not included. Includes library markings. Stock photo provided. Product includes identifying sticker. Better World Books: Buy Books. Do Good.

Condition: Good. Your purchase helps support Sri Lankan Children's Charity 'The Rainbow Centre'. Ex-library, so some stamps and wear, but in good overall condition. Our donations to The Rainbow Centre have helped provide an education and a safe haven to hundreds of children who live in appalling conditions.…

Paperback. Condition: Good. Connecting readers with great books since 1972! Used textbooks may not include companion materials such as access codes, etc. May have some wear or writing/highlighting. We ship orders daily and Customer Service is our top priority.

paperback. Condition: Good. Cover shows minor shelf wear and some sizeable creasing. Pages are clean, text and pictures are intact and unmarred. Back cover hinge binding is slightly loose/worn.

Condition: new.

Condition: New.

hardcover. Condition: Very Good.

hardcover. Condition: New. BRAND NEWOver 1,000,000 satisfied customers since 1997! Choose expedited shipping (if available) for much faster delivery. Delivery confirmation on all US orders.

Condition: New.

Condition: As New. Unread book in perfect condition.

Paperback. Condition: New. 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.…

Condition: New. First comprehensive tutorial and reference for C# implementation of data structures and algorithms. Num Pages: 368 pages, 11 tables 67 exercises. BIC Classification: UMB; UMX. Category: (P) Professional & Vocational; (U) Tertiary Education (US: College). Dimension: 236 x 193 x 19. Weight in Grams: 690. . 2007. paperback. . . . . …

Condition: New.

hardcover. Condition: New. In shrink wrap. Looks like an interesting title.

Condition: New.

Condition: As New. Unread book in perfect condition.

paperback. Condition: New. In shrink wrap. Looks like an interesting title.

Condition: New. First comprehensive tutorial and reference for C# implementation of data structures and algorithms. Num Pages: 368 pages, 11 tables 67 exercises. BIC Classification: UMB; UMX. Category: (P) Professional & Vocational; (U) Tertiary Education (US: College). Dimension: 236 x 193 x 19. Weight in Grams: 690. . 2007. paperback. . . . . Books ship from the US and Ireland. …

Condition: New. pp. 414.

Paperback. Condition: Brand New. new title edition. 412 pages. 9.25x7.00x1.00 inches. In Stock.

Taschenbuch. Condition: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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. …

Condition: New. First comprehensive tutorial and reference for C# implementation of data structures and algorithms. Num Pages: 366 pages, 11 tables 67 exercises. BIC Classification: UMB; UMX. Category: (P) Professional & Vocational; (U) Tertiary Education (US: College). Dimension: 187 x 264 x 27. Weight in Grams: 876. . 2007. Illustrated. hardcover. . . . . …

Paperback. Condition: New. 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.…

Condition: New. pp. 366.