Computer Algorithms: Introduction to Design and Analysis Hardback - 1999
by Baase, Sara
- Used
- very good
- Hardback
A$6.33
A$16.73
Delivery to USA
Standard delivery: 7 to 40 days
More delivery options
Standard delivery: 7 to 40 days
Ships from World of Books Ltd (West Sussex, United Kingdom)
Details
- Title Computer Algorithms: Introduction to Design and Analysis
- Author Baase, Sara
- Binding Hardback
- Edition INTERNATIONAL ED
- Condition Used - Very good
- Pages 720
- Volumes 1
- Language ENG
- Publisher Pearson, Lebanon, Indiana, U.S.A.
- Publication date 1999-11-05
- Features Bibliography, Index, Table of Contents
- Bookseller's Inventory # GOR004824772
- ISBN 9780201612448 / 0201612445
- Weight 2.76 lbs (1.25 kg)
- Dimensions 9.51 x 7.8 x 1.26 in (24.16 x 19.81 x 3.20 cm)
- Category Computers - Languages / Programming
- Library of Congress subjects Computer algorithms
- Library of Congress Catalogue Number 99014185
- Dewey Decimal Code 519.7
- Quantity available 1
About World of Books Ltd West Sussex, United Kingdom
Biblio member since 2007
In 2002, World of Books was founded on an ethos to do good, protect the planet, and support charities by enabling more goods to be reused. Since then, we've grown into a global pioneer, dedicated to helping people read more and waste less. Through the World of Books brand, customers can now buy and sell with us! We provide affordable, preloved books to book lovers all around the world, while also giving people the opportunity to contribute to the circular economy, earn money and protect the planet by trading in their unwanted books and media for cash. Through the B2B side of our business we've developed technology to help charities sell in bulk, meaning they can clear much needed floor space and make money for great causes at the same time. A new book will be sold once but their stories can be enjoyed by more than one owner. After all, a story doesn't change because it's been read before!
If you are not completely satisfied with your purchase for any reason, simply email customerservice@worldofbooks.com and we will quickly resolve any issues you may have. If you have any other queries about your order, please email customerservice@worldofbooks.com. Our goal is to deliver to our customers the best possible service and we hope your experience of dealing with us lives up to our promise. If for whatever reason we fail to meet your expectations then please let us know.
Reader reviews for Computer Algorithms: Introduction to Design and Analysis
Write a review for this book
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
From the rear cover
Drawing upon combined decades of teaching experience, Professors Sara Baase and Allen Van Gelder have extensively revised this best seller on algorithm design and analysis to make it the most current and accessible book available. This edition features an increased emphasis on algorithm design techniques such as divide-and-conquer and greedy algorithms, along with the addition of new topics and exercises. It continues the tradition of solid mathematical analysis and clear writing style that made it so popular in previous editions.
Highlights
- Emphasizes the development of algorithms through a step-by-step process rather than merely presenting the end result
- Stresses the importance of the algorithm analysis process--continuously re-evaluating, modifying, and perhaps rejecting algorithms until a satisfactory solution is attained
- Provides extensive treatment of recursion with a clear, student-friendly review of how it works and why it is a valuable programming technique
- Uses a Java-like pseudocode; includes an appendix with Java examples
