Stock photo: cover may vary
Computer Algorithms: Introduction to Design and Analysis Trade paperback - 1999
by Sara Baase,Allen Van Gelder
- Used
- Paperback
A$17.44
A$10.94
Delivery within USA
Standard delivery: 7 to 14 days
More delivery options
Standard delivery: 7 to 14 days
Ships from Pella Books (Iowa, United States)
Details
- Title Computer Algorithms: Introduction to Design and Analysis
- Author Sara Baase,Allen Van Gelder
- Binding Paperback
- Edition INTERNATIONAL ED
- Condition Used Good
- Pages 720
- Volumes 1
- Language ENG
- Publisher Pearson, Lebanon, Indiana, U.S.A.
- Publication date November 1999
- Features Bibliography, Index, Table of Contents
- Bookseller's Inventory # 241666
- 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
- Bookseller catalogues Computer
About Pella Books Iowa, United States
Biblio member since 2009
De Boekwinkel ~ Dutch for Pella's independent bookstore est. 1999. Located in a charming 1860 historic church worth seeing for its own sake and full of used, collectible, vintage, and local book treasures. We specialize in out-of-print, rare/scarce, and antiquarian books.
Terms of Sale: Books returnable for refund (less shipping fees) within seven days; the same book must be returned in the same condition that it was in when it was shipped. Buyer pays return shipping. If you have any questions regarding a book, please e-mail or call before ordering. We are an open brick and mortar store; books are subject to prior sale. We can accept only prepaid orders. If not using a credit card, books are held for seven days pending payment. Books are shipped by U. S. Postal Service media rate unless other arrangements are made. Priority is at least $7.50 for the first book or more depending on the zone and weight and $2.00 for each additional book; please e-mail or call to inquire about priority. Shipping/handling for sets, oversize books, and international shipping is extra: please e-mail or call to inquire. Although we do not designate every oversize book in the description, we will e-mail for approval that shipping/handling or tax is added to the amount before we charge your credit card. For domestic orders, we accept VISA, MasterCard, check, and money order. Because of currency conversion charges, international orders must be made with credit card. Iowa residents must add 7% sales tax.
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
