Introduction to the Design and Analysis of Algorithms
Levitin, Anany V.
Verkauft von Better World Books, Mishawaka, IN, USA
AbeBooks-Verkäufer seit 3. August 2006
Gebraucht - Softcover
Zustand: Good
Anzahl: 2 verfügbar
In den Warenkorb legenVerkauft von Better World Books, Mishawaka, IN, USA
AbeBooks-Verkäufer seit 3. August 2006
Zustand: Good
Anzahl: 2 verfügbar
In den Warenkorb legenFormer library book; may include library markings. Used book that is in clean, average condition without any missing pages.
Bestandsnummer des Verkäufers 45587211-6
Based on a
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 coherent and innovative manner. Written in a student-friendly style, the book emphasizes the understanding of ideas over excessively formal treatment while thoroughly covering the material required in an introductory algorithms course. 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 detailed solution manual.
Algorithms
Introduction to The Design & Analysis of Algorithms, 2nd Edition
Anany Levitin, Villanova University
Valued by students and trusted by instructors, Introduction to the Design and Analysis of Algorithms employs a comprehensive taxonomy of algorithm design techniques that is more powerful and intuitive than the traditional approach.
It provides a coherent and pedagogically sound framework for learning and teaching algorithms. An extensive, detailed solutions manual is available online for the benefit of students and instructors. Student learning is further supported by exercise hints and chapter summaries. Popular puzzles and games provide motivation for students, and rhetorical questioning serves as an effective learning device.
Ideal for a basic course in the design and analysis of algorithms, this Second Edition features 80 new puzzles and exercises, as well as:
Separate sections on the analysis of nonrecursive and recursive algorithms
Coverage of empirical analysis and algorithm visualization
Revised section on approximation algorithms
Brand-new chapter on iterative improvement algorithms covering the simplex method, network flows, maximum matching in bipartite graphs, and the stable marriage problem„Über diesen Titel“ kann sich auf eine andere Ausgabe dieses Titels beziehen.
Better World Books (BWB) values your satisfaction and offers you returns within thirty (30) days after the estimated delivery date on most items. All returned items must be in the original condition; used items should include the SKU sticker located on the spine or back of the product.
If you have an incomplete, incorrect, or damaged shipment, please contact our Customer Care team via Abebooks contact seller options before proceeding with the return.Please keep in mind that because we deal mostl...
Mehr InformationPlease allow 1-2 business days for order fulfillment.