{"product_id":"practical-analysis-of-algorithms-9783319098876","title":"Practical Analysis of Algorithms","description":"This book introduces the essential concepts of algorithm analysis required by core undergraduate and graduate computer science courses, in addition to providing a review of the fundamental mathematical notions necessary to understand these concepts. Features: includes numerous fully-worked examples and step-by-step proofs, assuming no strong mathematical background; describes the foundation of the analysis of algorithms theory in terms of the big-Oh, Omega, and Theta notations; examines recurrence relations; discusses the concepts of basic operation, traditional loop counting, and best case and worst case complexities; reviews various algorithms of a probabilistic nature, and uses elements of probability theory to compute the average complexity of algorithms such as Quicksort; introduces a variety of classical finite graph algorithms, together with an analysis of their complexity; provides an appendix on probability theory, reviewing the major definitions and theorems used in the book.\u003cbr\u003e\u003cbr\u003e\u003cbr\u003e\u003cb\u003eAbout the Author\u003c\/b\u003e\u003cbr\u003e\u003cb\u003eDr. Dana Vrajitoru\u003c\/b\u003e is an Associate Professor of Computer Science at Indiana University South Bend, IN, USA. \u003cb\u003eDr. William Knight\u003c\/b\u003e is an Emeritus Associate Professor at the same institution.\u003cbr\u003e","brand":"Springer","offers":[{"title":"Default Title","offer_id":50857667461394,"sku":"9783319098876","price":59.99,"currency_code":"USD","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0831\/4771\/8930\/files\/img_dbc2f490-df99-4927-9cf4-67028bc4597b.jpg?v=1737538571","url":"https:\/\/surprise-castle.myshopify.com\/products\/practical-analysis-of-algorithms-9783319098876","provider":"Surprise Castle","version":"1.0","type":"link"}