Introduction to the Design & Analysis of Algorithms
US $7.31
Condition:
Good
A book that has been read but is in good condition. Very minimal damage to the cover including scuff marks, but no holes or tears. The dust jacket for hard covers may not be included. Binding has minimal wear. The majority of pages are undamaged with minimal creasing or tearing, minimal pencil underlining of text, no highlighting of text, no writing in margins. No missing pages. See the seller’s listing for full details and description of any imperfections.
- Buy It NowIntroduction to the Design & Analysis of Algorithms
Oops! Looks like we're having trouble connecting to our server.
Refresh your browser window to try again.
Shipping:
Free USPS Media MailTM.
Located in: Haltom City, Texas, United States
Delivery:
Estimated between Wed, May 7 and Mon, May 12 to 43230
Returns:
30 days returns. Buyer pays for return shipping. If you use an eBay shipping label, it will be deducted from your refund amount.
Payments:
Special financing available. See terms and apply now- for PayPal Credit, opens in a new window or tab
Earn up to 5x points when you use your eBay Mastercard®. Learn moreabout earning points with eBay Mastercard
Shop with confidence
Seller assumes all responsibility for this listing.
eBay item number:156768785988
Item specifics
- Condition
- Release Year
- 2002
- Book Title
- Introduction to the Design & Analysis of Algorithms
- ISBN
- 9780201743951
- Subject Area
- Computers
- Publication Name
- Introduction to the Design and Analysis of Algorithms
- Publisher
- Benjamin-Cummings Publishing Company
- Item Length
- 9.3 in
- Subject
- Programming / Algorithms
- Publication Year
- 2002
- Type
- Textbook
- Format
- Trade Paperback
- Language
- English
- Item Height
- 1.1 in
- Item Weight
- 34.2 Oz
- Item Width
- 7.6 in
- Number of Pages
- 528 Pages
About this product
Product Identifiers
Publisher
Benjamin-Cummings Publishing Company
ISBN-10
0201743957
ISBN-13
9780201743951
eBay Product ID (ePID)
2254287
Product Key Features
Number of Pages
528 Pages
Publication Name
Introduction to the Design and Analysis of Algorithms
Language
English
Subject
Programming / Algorithms
Publication Year
2002
Type
Textbook
Subject Area
Computers
Format
Trade Paperback
Dimensions
Item Height
1.1 in
Item Weight
34.2 Oz
Item Length
9.3 in
Item Width
7.6 in
Additional Product Features
Intended Audience
College Audience
LCCN
2002-027987
Dewey Edition
22
Illustrated
Yes
Dewey Decimal
005.1
Table Of Content
( Each chapter ends with a "Summary". ) Preface. 1. Introduction. The notion of algorithm.Fundamentals of algorithmic problem solving.Important problem types.Fundamental data structures. 2. Fundamentals of the Analysis of Algorithm Efficiency. Analysis framework.Asymptotic notations and standard efficiency classes.Mathematical analysis of nonrecursive algorithms.Mathematical analysis of recursive algorithms.Example: Fibonacci numbers.Empirical analysis of algorithms.Algorithm visualization. 3. Brute Force. Selection sort and bubble sort.Sequential search and brute-force string matching.The closest-pair and convex-hull problems by brute force.Exhaustive search. 4. Divide-and-Conquer. Mergesort.Quicksort.Binary search.Binary tree traversals and related properties.Multiplication of large integers and Strassen's matrix multiplication.Closest-pair and convex-hull problems by divide-and-conquer. 5. Decrease-and-Conquer. Insertion sort.Depth-first search and breadth-first search.Topological sorting.Algorithms for generating combinatorial objects.Decrease-by-a-constant-factor algorithms.Variable-size-decrease algorithms. 6. Transform-and-conquer. Presorting.Gaussian elimination.Balanced search trees.Heaps and heapsort.Horner's rule and binary exponentiation.Problem reduction. 7. Space and Time Tradeoffs. Sorting by counting.Horspool's and Boyer-Moore algorithms for string matching.Hashing.B-trees. 8. Dynamic Programming. Computing a binomial coefficient.Shortest-path problems.Warshall's and Floyd's algorithms.Optimal binary search trees.The knapsack problem and memory functions. 9. Greedy Technique. Prim's algorithm.Kruskal's algorithm.Dijkstra's algorithm.Huffman trees. 10. Limitations of Algorithm Power. Lower-bound arguments.Decision trees. P , NP , and NP -complete problems.Challenges of numerical algorithms. 11. Coping with the Limitations of Algorithm Power. Backtracking.Branch-and-bound.Approximation algorithms for NP -hard problems.Algorithms for solving nonlinear equations. Epilogue. Appendix A: Useful Formulas for the Analysis of Algorithms. Appendix B: Short Tutorial on Recurrence Relations. Bibliography. Hints to Exercises. Index.
Synopsis
This text introduces the reader to the design and analysis of algorithms. It teaches broad problem-solving skills alongside an introduction to algorithms. The author achieves this by using three unique features: a table of contents that is based on a more effective taxonomy of algorithm design techniques; a style of presentation that emphasizes understanding over excessively formal treatment; and extensive use of puzzles and exercises that motivate the presentation of the material., Based on a new classification of algorithm design techniques and a clear delineation of analysis methods, Introduction to the Design and Analysis of Algorithms presents the subject in a truly innovative manner. Written in a student-friendly style, the book encourages broad problem-solving skills while thoroughly covering the material required in an introductory algorithms course. The author emphasizes conceptual understanding before the introduction of the formal treatment of each technique. Popular puzzles are used to motivate students' interest and strengthen their skills in algorithmic problem solving. Other learning-enhancement features include chapter summaries, hints to the exercises, and a solution manual.
LC Classification Number
QA76.9.A43L48 2003
Item description from the seller
Popular categories from this store
Seller feedback (12,658)
- 1***a (287)- Feedback left by buyer.Past monthVerified purchaseAA++! great seller , reasonable price ! shipped fast and packaged well for protection , was in exactly as described condition , very pleased , thanks so much !!
- g***g (1340)- Feedback left by buyer.Past 6 monthsVerified purchaseItem as described. Great value for a quality book. Exceptionally careful packing ensured that the book arrived undamaged. I highly recommend this seller.Mere Christianity Gift Edition , Lewis, C. S. , (#156451457511)
- n***1 (28)- Feedback left by buyer.Past 6 monthsVerified purchaseExcellent seller, book arrived promptly in solid package, exactly as described, great value!In Search of Lost Time, Vol. 3: The Guermantes Way , Proust, Marcel , (#156485363945)
More to explore :
- Design Textbooks,
- Design Textbook Textbooks,
- Architecture & Design Magazines,
- Nonfiction Design Fiction & Nonfiction Books,
- Nonfiction Design Coloring Books Books,
- Architecture & Design Magazines 1940-1979,
- Nonfiction Books Fiction & Graphic Design,
- Architecture & Design Magazines 1900-1939,
- Nonfiction Books in Japanese Fiction & Graphic Design,
- Art & Culture Nonfiction Design Fiction & Nonfiction Books
Popular categories from this store
Seller feedback (12,658)
- 1***a (287)- Feedback left by buyer.Past monthVerified purchaseAA++! great seller , reasonable price ! shipped fast and packaged well for protection , was in exactly as described condition , very pleased , thanks so much !!
- g***g (1340)- Feedback left by buyer.Past 6 monthsVerified purchaseItem as described. Great value for a quality book. Exceptionally careful packing ensured that the book arrived undamaged. I highly recommend this seller.Mere Christianity Gift Edition , Lewis, C. S. , (#156451457511)
- n***1 (28)- Feedback left by buyer.Past 6 monthsVerified purchaseExcellent seller, book arrived promptly in solid package, exactly as described, great value!In Search of Lost Time, Vol. 3: The Guermantes Way , Proust, Marcel , (#156485363945)