{"product_id":"algorithms-2-a-quickstudy-laminated-reference-guide-9781423245636","title":"Algorithms 2: A Quickstudy Laminated Reference Guide","description":"Covering the essential concepts of the computer science area of algorithms, this 6 page laminated guide is part 2 of 2 guides that also serves as a reference for designing and analyzing algorithms. Guaranteed to boost grades in required algorithms courses this reference tool can continue to offer support well beyond a course. While all computing requires the use of algorithms, mastery of algorithms can lead to a career in the fastest growing field in computer science with one of the highest paid salaries. Widely published author and instructor Babak Ahmadi has masterfully covered a large amount of information in only 6 pages, streamlined with more facts per page than any publication. To get the full breadth of coverage please also purchase the Algorithms guide for a highly valuable and complete reference at an amazing price. \u003cbr\u003e 6 page laminated reference guide includes: \u003cul\u003e\n\u003cli\u003eAnalysis \u0026amp; Optimization\u003c\/li\u003e\n\u003cli\u003eAsymptotic Notation (Big-O Notation) \u003cul\u003e\u003cli\u003eAsymptotic Notation Types\u003c\/li\u003e\u003c\/ul\u003e\n\u003c\/li\u003e\n\u003cli\u003eComplexity Types (AKA Function Orders \u0026amp; Growth Rates) \u003cul\u003e\u003cli\u003eComplexity Classes (P \u0026amp; NP)\u003c\/li\u003e\u003c\/ul\u003e\n\u003c\/li\u003e\n\u003cli\u003eLower Bound Theory \u003cul\u003e\u003cli\u003eCases vs. Bounds\u003c\/li\u003e\u003c\/ul\u003e\n\u003c\/li\u003e\n\u003cli\u003eAnalysis of Loops\u003c\/li\u003e\n\u003cli\u003eRecurrences\u003c\/li\u003e\n\u003cli\u003eMethods for Solving Recurrences\u003c\/li\u003e\n\u003cli\u003eAmortized Analysis\u003c\/li\u003e\n\u003cli\u003eSearch \u0026amp; Sort \u003cul\u003e\n\u003cli\u003eStability\u003c\/li\u003e\n\u003cli\u003eComparison Sorting\u003c\/li\u003e\n\u003cli\u003eNon-Comparison Sorting\u003c\/li\u003e\n\u003cli\u003eSort Algorithms\u003c\/li\u003e\n\u003cli\u003eCommon Search Algorithms\u003c\/li\u003e\n\u003cli\u003eString Searching (AKA Pattern Matching)\u003c\/li\u003e\n\u003c\/ul\u003e\n\u003c\/li\u003e\n\u003cli\u003eProcess\/Implementation Types \u003cul\u003e\n\u003cli\u003eDeterministic vs. Nondeterministic\u003c\/li\u003e\n\u003cli\u003eLinear Programming (LP)\u003c\/li\u003e\n\u003cli\u003eDynamic Programming (DP)\u003c\/li\u003e\n\u003c\/ul\u003e\n\u003c\/li\u003e\n\u003c\/ul\u003e\u003cbr\u003e","brand":"Quickstudy Reference Guides","offers":[{"title":"Default Title","offer_id":50647197778194,"sku":"9781423245636","price":5.99,"currency_code":"USD","in_stock":false}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0831\/4771\/8930\/files\/img_8b020f94-1d12-4ad4-9178-3cba65c5cdf8.jpg?v=1733197910","url":"https:\/\/surprise-castle.myshopify.com\/products\/algorithms-2-a-quickstudy-laminated-reference-guide-9781423245636","provider":"Surprise Castle","version":"1.0","type":"link"}