With simple examples and straightforward implementations, this text describes a broad variety of useful algorithms in a clear readable style. The emphasis is on teaching the main ideas behind the methods as it surveys the most important algorithms and data structures in use today.
Read More
With simple examples and straightforward implementations, this text describes a broad variety of useful algorithms in a clear readable style. The emphasis is on teaching the main ideas behind the methods as it surveys the most important algorithms and data structures in use today.
Read Less
Add this copy of Algorithms (4th Edition) to cart. $53.03, fair condition, Sold by BooksRun rated 4.0 out of 5 stars, ships from Philadelphia, PA, UNITED STATES, published 2011 by Addison-Wesley Professional.
Add this copy of Algorithms (4th Edition) to cart. $53.04, very good condition, Sold by BooksRun rated 4.0 out of 5 stars, ships from Philadelphia, PA, UNITED STATES, published 2011 by Addison-Wesley Professional.
Add this copy of Algorithms (4th Edition) to cart. $53.04, good condition, Sold by BooksRun rated 4.0 out of 5 stars, ships from Philadelphia, PA, UNITED STATES, published 2011 by Addison-Wesley Professional.
Add this copy of Algorithms (4th Edition) to cart. $53.49, good condition, Sold by Book Forest rated 4.0 out of 5 stars, ships from San Rafael, CA, UNITED STATES, published 2011 by Addison-Wesley Professional.
Choose your shipping method in Checkout. Costs may vary based on destination.
Seller's Description:
Good. Text block firm and clean, binding unblemished, boards straight, without highlights or underlining. Without any discs, access codes or extra items. Supporting Bay Area Friends of the Library since 2010. Well packaged and promptly shipped.
Add this copy of Algorithms (4th Edition) to cart. $53.50, fair condition, Sold by Goodwill Books rated 5.0 out of 5 stars, ships from Hillsboro, OR, UNITED STATES, published 2011 by Addison-Wesley Professional.
Add this copy of Algorithms (4th Edition) to cart. $53.51, good condition, Sold by Goodwill Books rated 5.0 out of 5 stars, ships from Hillsboro, OR, UNITED STATES, published 2011 by Addison-Wesley Professional.
Add this copy of Algorithms (4th Edition) to cart. $53.53, fair condition, Sold by Goodwill of Orange County rated 5.0 out of 5 stars, ships from Santa Ana, CA, UNITED STATES, published 2011 by Addison-Wesley Professional.
Choose your shipping method in Checkout. Costs may vary based on destination.
Seller's Description:
Fair. This is a USED book, it is subject to external and interior wear including, underlining, highlighting, annotations, water damage, minor scuffs and tears. This is a donated book accepted as is. Stickers and sticker residue on the cover should be expected, as well as spine wear from use. There are NO codes or disc(s) included. All items ship Monday-Friday within 2-3 business days. Thank you for supporting Goodwill of OC.
Add this copy of Algorithms (4th Edition) to cart. $53.56, good condition, Sold by Bookmans rated 4.0 out of 5 stars, ships from Tucson, AZ, UNITED STATES, published 2011 by Addison-Wesley Professional.
Add this copy of Algorithms to cart. $55.00, like new condition, Sold by Galaxy.SBook rated 4.0 out of 5 stars, ships from Stockton, CA, UNITED STATES, published 2011 by Addison-Wesley Professional.
Choose your shipping method in Checkout. Costs may vary based on destination.
Seller's Description:
Fine in fine dust jacket. Sewn binding. Cloth over boards. 976 p. Contains: Illustrations. Audience: General/trade. The leading introduction to computer algorithms in use today, including fifty algorithms every programmer should know Princeton Computer Science professors, Robert Sedgewick and Kevin Wayne, survey the most important computer algorithms in use and of interest to anyone working in science, mathematics, and engineering, and those who use computation in the liberal arts. They provide a full treatment of data structures and algorithms for key areas that enable you to confidently implement, debug, and put them to work in any computational environment. Fundamentals: Basic programming models Data abstraction Bags, queues, and stacks Analysis of algorithms Sorting Elementary sorts Mergesort Quicksort Priority queues Applications Graphs Undirected graphs Directed graphs Minimum spanning trees Shortest paths Strings String sorts Tries Substring search Regular expressions Data compression These algorithms are generally ingenious creations that, remarkably, can each be expressed in just a dozen or two lines of code. As a group, they represent problem-solving power of amazing scope. They have enabled the construction of computational artifacts, the solution of scientific problems, and the development of commercial applications that would not have been feasible without them. Note: Supplemental material (e.g. CDs, DVDs, access codes, or lab manuals) is only included with a new textbook purchase.
