Skip to content

Algorithms
Stock Photo: Cover May Be Different

Algorithms Hardcover - 2003

by Johnsonbaugh, Richard

  • Used
  • Hardcover
Drop Ship Order

Description

Pearson, 2003-08-10. hardcover. Used: Good.
Used: Good
NZ$40.87
FREE Shipping to USA Standard delivery: 5 to 10 days
More Shipping Options
Ships from Ergodebooks (Texas, United States)

About Ergodebooks Texas, United States

Biblio member since 2005
Seller rating: This seller has earned a 3 of 5 Stars rating from Biblio customers.

Our goal is to provide best customer service and good condition books for the lowest possible price. We are always honest about condition of book. We list book only by ISBN # and hence exact book is guaranteed.

Terms of Sale:

We have 30 day return policy.

Browse books from Ergodebooks

Details

  • Title Algorithms
  • Author Johnsonbaugh, Richard
  • Series Jk Computer Science and Mathematics
  • Binding Hardcover
  • Edition INTERNATIONAL ED
  • Condition Used: Good
  • Pages 752
  • Volumes 1
  • Language ENG
  • Publisher Pearson, Lebanon, Indiana, U.S.A.
  • Date 2003-08-10
  • Illustrated Yes
  • Bookseller's Inventory # SONG0023606924
  • ISBN 9780023606922 / 0023606924
  • Weight 3.3 lbs (1.50 kg)
  • Dimensions 10 x 8.3 x 1.3 in (25.40 x 21.08 x 3.30 cm)
  • Library of Congress subjects Computer algorithms
  • Library of Congress Catalog Number 2003054834
  • Dewey Decimal Code 005.1

About the author

Richard Johnsonbaugh is Professor Emeritus of Computer Science at DePaul University. He has degrees in computer science and mathematics from the University of Oregon, Yale University, and the University of Illinois at Chicago. He is the author of numerous articles and books, including Discrete Mathematics, Fifth Edition, and, with co-author Martin Kalin, Object-Oriented Programming in C++, Second Edition, Applications Programming in C++, and Applications Programming in ANSI C, Third Edition.

Marcus Schaefer is Assistant Professor of Computer Science at DePaul University. He holds degrees in computer science and mathematics from the University of Chicago and the Universitat Karlsruhe. He has authored and co-authored several articles on complexity theory, computability, and graph theory.