{"product_id":"138956","title":"Introduction to Algorithms ","description":"\u003ccenter\u003e\u003cdiv style=\"text-align:center\"\u003e\u003cimg src=\"https:\/\/tmgdisk01.cafe24.com\/images\/vs\/4172\/sv\/3jXPeMCk1Rk1kQYmLKThmPEsxyDnwJ.png?v=1765071139\" style=\"max-width:100%;max-height:10px\"\u003e\u003c\/div\u003e\u003c\/center\u003e\n\u003ccenter\u003e\u003ctable\u003e\u003ctr\u003e\u003ctd style=\"height:10px\"\u003e\u003c\/td\u003e\u003c\/tr\u003e\u003c\/table\u003e\u003c\/center\u003e\n\u003ccenter\u003e\u003ctable\u003e\u003ctr\u003e\u003ctd style=\"height:10px\"\u003e\u003c\/td\u003e\u003c\/tr\u003e\u003c\/table\u003e\u003c\/center\u003e\n\u003ccenter\u003e\n\n\u003cdiv style=\"width:95%\"\u003e\n\n\u003cdiv style=\"text-align:center;font-size:30px;font-weight:bolder;line-height:1.6em\"\u003e Introduction to Algorithms \u003c\/div\u003e\n\n\u003ccenter\u003e\u003ctable\u003e\u003ctr\u003e\u003ctd style=\"height:10px\"\u003e\u003c\/td\u003e\u003c\/tr\u003e\u003c\/table\u003e\u003c\/center\u003e\n\n\u003ccenter\u003e\u003ctable\u003e\u003ctr\u003e\u003ctd style=\"height:10px\"\u003e\u003c\/td\u003e\u003c\/tr\u003e\u003c\/table\u003e\u003c\/center\u003e\n\n\u003ccenter\u003e\u003ctable\u003e\u003ctr\u003e\u003ctd style=\"height:10px\"\u003e\u003c\/td\u003e\u003c\/tr\u003e\u003c\/table\u003e\u003c\/center\u003e\n\n\u003ccenter\u003e\u003ctable\u003e\u003ctr\u003e\u003ctd style=\"height:10px\"\u003e\u003c\/td\u003e\u003c\/tr\u003e\u003c\/table\u003e\u003c\/center\u003e\n\n\u003cdiv style=\"border-bottom:1px;border-bottom-style:dotted;border-color:;padding-bottom:20px\"\u003e\u003ccenter\u003e\u003ctable align=\"center\" width=\"100%\"\u003e\u003ctbody style=\"border:0px\"\u003e\n\n\u003ctr\u003e\u003ctd align=\"center\" style=\"line-height:1.2em;text-align:center;font-size:18px;color:black;font-weight:bold;padding-bottom:20px;\"\u003e\u003c\/td\u003e\u003c\/tr\u003e\n\n\u003ctr\u003e\u003ctd style=\"text-align:center\"\u003e\u003cimg src=\"https:\/\/image.yes24.com\/goods\/128268689\/XL\" style=\"max-width:100%;height:auto\"\u003e\u003c\/td\u003e\u003c\/tr\u003e\n\n\n\u003c\/tbody\u003e\u003c\/table\u003e\u003c\/center\u003e\u003c\/div\u003e\n\n\u003ccenter\u003e\u003ctable\u003e\u003ctr\u003e\u003ctd style=\"height:10px\"\u003e\u003c\/td\u003e\u003c\/tr\u003e\u003c\/table\u003e\u003c\/center\u003e\n\n\u003ccenter\u003e\u003ctable\u003e\u003ctr\u003e\u003ctd style=\"height:10px\"\u003e\u003c\/td\u003e\u003c\/tr\u003e\u003c\/table\u003e\u003c\/center\u003e\n\n\u003cdiv style=\"width:95%;{split_style6}padding-top:20px;padding-bottom:20px\"\u003e\n\n\u003cdiv style=\"text-align:left;font-size:16px;font-weight:bold;padding-bottom:20px\"\u003e Description \u003c\/div\u003e\n\n\u003cdiv style=\"text-align:left;word-break:break-all;font-size:14px;line-height:1.6em;\"\u003e\n\n\u003cdiv\u003e\u003ch5\u003e \u003cb\u003eBook Introduction\u003c\/b\u003e\n\u003c\/h5\u003e\u003c\/div\u003e\n\u003cdiv\u003e\n\u003cdiv\u003e\u003cdiv\u003e \u003cb\u003eA Guide to Algorithm Learning and Evolution\u003c\/b\u003e\u003cbr\u003e\u003cbr\u003e This is the latest revised edition of the famous book that has established itself as the bible of algorithmic learning worldwide. \u003cbr\u003eWhile maintaining the strengths of the previous edition, which encompassed both the depth and breadth of algorithms and balanced theory and practice, numerous changes have been made to further upgrade its completeness.\u003cbr\u003e The 4th edition covers three new topics: bipartite graph matching, online algorithms, and machine learning algorithms. Several sections have been updated with algorithms that reflect the latest research findings and technological changes in each field.\u003cbr\u003e Additionally, explanations have been made clearer, 140 new practice problems and 22 comprehensive problems have been added, and many existing problems have been improved based on reader feedback.\u003cbr\u003e\u003cbr\u003e\u003cbr\u003e ※ Some answers to the practice\/comprehensive problems in this book are available at http:\/\/mitpress.mit.edu\/algorithms.\u003cbr\u003e\n\u003c\/div\u003e\u003c\/div\u003e\n\u003cdiv\u003e\u003cul\u003e\u003cli\u003e You can preview some of the book's contents.\u003cbr\u003e \u003cspan\u003ePreview\u003c\/span\u003e\n\n\u003c\/li\u003e\u003c\/ul\u003e\u003c\/div\u003e\n\u003c\/div\u003e \",\"\u003cdiv\u003e\u003ch5\u003e \u003cb\u003eindex\u003c\/b\u003e\n\u003c\/h5\u003e\u003c\/div\u003e\n\u003cdiv\u003e\n\u003cdiv\u003e \u003cb\u003ePART 01 Basics\u003c\/b\u003e\u003cbr\u003e\u003cbr\u003e Chapter 01 The Role of Algorithms\u003cbr\u003e 1.1 Algorithm\u003cbr\u003e 1.2 Algorithms as Technology\u003cbr\u003e\u003cbr\u003e Chapter 02 Getting Started  \u003cbr\u003e2.1 Insertion sort\u003cbr\u003e 2.2 Analysis of the Algorithm\u003cbr\u003e 2.3 Algorithm Design\u003cbr\u003e\u003cbr\u003e Chapter 03 Execution Time Characterization\u003cbr\u003e 3.1 O-notation, Ω-notation, Θ-notation\u003cbr\u003e 3.2 Asymptotic notation: Formal definition\u003cbr\u003e 3.3 Standard notation and commonly used functions\u003cbr\u003e\u003cbr\u003e Chapter 04 Divide and Conquer\u003cbr\u003e 4.1 Multiplying square matrices\u003cbr\u003e 4.2 Strassen's algorithm for matrix multiplication\u003cbr\u003e 4.3 Substitution method to solve the ignition formula\u003cbr\u003e 4.4 Recursive tree method for solving recurrence relation\u003cbr\u003e 4.5 Master method for solving ignition equations\u003cbr\u003e 4.6 Proof of the Continuous Master Theorem\u003cbr\u003e 4.7 Accra-Bazzi ignition\u003cbr\u003e\u003cbr\u003e Chapter 05 Probabilistic Analysis and Randomized Algorithms\u003cbr\u003e 5.1 Employment Issues\u003cbr\u003e 5.2 Indicator probability variables\u003cbr\u003e 5.3 Randomized Algorithm\u003cbr\u003e 5.4 Probabilistic Analysis and Other Uses of Indicator Probability Variables\u003cbr\u003e\u003cbr\u003e \u003cb\u003ePART 02 Sorting and Order Statistics\u003c\/b\u003e\u003cbr\u003e\u003cbr\u003e Chapter 06 Heap Sort\u003cbr\u003e 6.1 Heap\u003cbr\u003e 6.2 Maintaining Heap Properties\u003cbr\u003e 6.3 Creating a heap\u003cbr\u003e 6.4 Heap sort algorithm\u003cbr\u003e 6.5 Priority Queue\u003cbr\u003e\u003cbr\u003e Chapter 07 Quick Sort\u003cbr\u003e 7.1 Introduction to Quick Sort\u003cbr\u003e 7.2 Quick sort performance\u003cbr\u003e 7.3 Randomized quicksort  \u003cbr\u003e7.4 Quicksort Analysis\u003cbr\u003e\u003cbr\u003e Chapter 08 Linear Time Sorting\u003cbr\u003e 8.1 Lower bounds of sorting\u003cbr\u003e 8.2 Counting sort\u003cbr\u003e 8.3 Radix sort\u003cbr\u003e 8.4 Bucket sort\u003cbr\u003e\u003cbr\u003e Chapter 09 Median and Order Statistics\u003cbr\u003e 9.1 Minimum and maximum values\u003cbr\u003e 9.2 Choosing on average linear execution time\u003cbr\u003e 9.3 Choosing in worst-case linear time\u003cbr\u003e\u003cbr\u003e \u003cb\u003ePART 03 Data Structures\u003c\/b\u003e\u003cbr\u003e\u003cbr\u003e Chapter 10 Basic Data Structures\u003cbr\u003e 10.1 Simple array-based data structures: arrays, matrices, stacks, and queues\u003cbr\u003e 10.2 Linked Lists\u003cbr\u003e 10.3 Representing a Rooted Tree\u003cbr\u003e\u003cbr\u003e Chapter 11 Hash Tables\u003cbr\u003e 11.1 Direct Address Table\u003cbr\u003e 11.2 Hash Table\u003cbr\u003e 11.3 Hash Functions\u003cbr\u003e 11.4 Open Address Method\u003cbr\u003e 11.5 Practical Considerations\u003cbr\u003e\u003cbr\u003e Chapter 12 Binary Search Trees\u003cbr\u003e 12.1 Concept of binary search tree\u003cbr\u003e 12.2 Queries on Binary Search Trees\u003cbr\u003e 12.3 Insertion and Deletion\u003cbr\u003e\u003cbr\u003e Chapter 13 Red Black Tree\u003cbr\u003e 13.1 Characteristics of Red-Black Trees\u003cbr\u003e 13.2 rotations\u003cbr\u003e 13.3 Insert\u003cbr\u003e 13.4 Delete\u003cbr\u003e\u003cbr\u003e \u003cb\u003ePART 04 ADVANCED DESIGN AND ANALYSIS TECHNIQUES\u003c\/b\u003e\u003cbr\u003e\u003cbr\u003e Chapter 14 Dynamic Programming ㆍ 385\u003cbr\u003e 14.1 Cutting the Bar\u003cbr\u003e 14.2 Matrix Chain Multiplication  \u003cbr\u003e14.3 Elements of Dynamic Programming\u003cbr\u003e 14.4 Longest Common Subsequence (LCS)\u003cbr\u003e 14.5 Optimal Binary Search Tree\u003cbr\u003e\u003cbr\u003e Chapter 15 Greedy Algorithms\u003cbr\u003e 15.1 Activity Selection Problem\u003cbr\u003e 15.2 Elements of Greedy Methods\u003cbr\u003e 15.3 Huffman code\u003cbr\u003e 15.4 Offline Caching\u003cbr\u003e\u003cbr\u003e Chapter 16 Split Payment Analysis\u003cbr\u003e 16.1 Total Analysis\u003cbr\u003e 16.2 Settlement Method\u003cbr\u003e 16.3 Latent function method\u003cbr\u003e 16.4 Dynamic Tables\u003cbr\u003e\u003cbr\u003e \u003cb\u003ePART 05 ADVANCED DATA STRUCTURES\u003c\/b\u003e\u003cbr\u003e\u003cbr\u003e Chapter 17: Extending Data Structures\u003cbr\u003e 17.1 Dynamic Order Statistics\u003cbr\u003e 17.2 Data Structure Extension Techniques\u003cbr\u003e 17.3 Interval Tree\u003cbr\u003e\u003cbr\u003e Chapter 18 B-Trees\u003cbr\u003e 18.1 Definition of B-tree\u003cbr\u003e 18.2 Basic Operations on B-Trees\u003cbr\u003e 18.3 Deleting a Key in a B-Tree\u003cbr\u003e\u003cbr\u003e Chapter 19 Data Structures for Disjoint Sets\u003cbr\u003e 19.1 Operations on disjoint sets\u003cbr\u003e 19.2 Linked list representation of disjoint sets\u003cbr\u003e 19.3 Disjoint Set Forest\u003cbr\u003e 19.4 Analysis of Unions by Rank Using Path Compression\u003cbr\u003e\u003cbr\u003e \u003cb\u003ePART 06 Graph Algorithms\u003c\/b\u003e\u003cbr\u003e\u003cbr\u003e Chapter 20 Basic Graph Algorithms\u003cbr\u003e 20.1 Representation of Graphs\u003cbr\u003e 20.2 Breadth-First Search\u003cbr\u003e 20.3 Depth-first search  \u003cbr\u003e20.4 Topological sorting\u003cbr\u003e 20.5 Strong connection elements\u003cbr\u003e\u003cbr\u003e Chapter 21 Minimum Spanning Trees\u003cbr\u003e 21.1 Extension of the minimum spanning tree\u003cbr\u003e 21.2 Kruskal's algorithm and Prim's algorithm\u003cbr\u003e\u003cbr\u003e Chapter 22 Single-Starting Point Shortest Path\u003cbr\u003e 22.1 Bellman-Ford Algorithm\u003cbr\u003e 22.2 Single-origin shortest path in a directed acyclic graph\u003cbr\u003e 22.3 Dijkstra's algorithm\u003cbr\u003e 22.4 Difference Constraints and Shortest Paths\u003cbr\u003e 22.5 Proof of the shortest path property\u003cbr\u003e\u003cbr\u003e Chapter 23 All-pair Shortest Paths\u003cbr\u003e 23.1 Shortest Paths and Matrix Multiplication\u003cbr\u003e 23.2 Floyd-Warshall Algorithm\u003cbr\u003e 23.3 Johnson's algorithm for sparse graphs\u003cbr\u003e\u003cbr\u003e Chapter 24 Maximum Flow\u003cbr\u003e 24.1 Flow Network\u003cbr\u003e 24.2 Ford-Fulkerson method\u003cbr\u003e 24.3 Maximum Bipartite Matching\u003cbr\u003e\u003cbr\u003e Chapter 25 Matching in Bipartite Graphs\u003cbr\u003e 25.1 Maximum Bipartite Matching (Revisit)\u003cbr\u003e 25.2 Stable Marriage Issues\u003cbr\u003e 25.3 Hungarian Algorithm for Assignment Problems\u003cbr\u003e\u003cbr\u003e \u003cb\u003ePART 07 Important Topics in Algorithms\u003c\/b\u003e\u003cbr\u003e\u003cbr\u003e Chapter 26 Parallel Algorithms\u003cbr\u003e 26.1 Basics of Fork-Join Parallelism\u003cbr\u003e 26.2 Parallel Matrix Multiplication  \u003cbr\u003e26.3 Parallel merge sort\u003cbr\u003e\u003cbr\u003e Chapter 27 Online Algorithms\u003cbr\u003e 27.1 Waiting for the elevator\u003cbr\u003e 27.2 Maintaining the search list\u003cbr\u003e 27.3 Online Caching\u003cbr\u003e\u003cbr\u003e Chapter 28 Matrix Operations\u003cbr\u003e 28.1 Solving Systems of Linear Equations\u003cbr\u003e 28.2 Inverse matrix\u003cbr\u003e 28.3 Positive definite symmetric matrices and least-squares approximations\u003cbr\u003e\u003cbr\u003e Chapter 29 Linear Programming\u003cbr\u003e 29.1 Linear Programming Formulas and Algorithms\u003cbr\u003e 29.2 Expressing the Problem Using Linear Programming\u003cbr\u003e 29.3 Duality\u003cbr\u003e\u003cbr\u003e Chapter 30 Polynomials and FFTs\u003cbr\u003e 30.1 Representation of polynomials\u003cbr\u003e 30.2 DFT and FFT\u003cbr\u003e 30.3 FFT circuit\u003cbr\u003e\u003cbr\u003e Chapter 31 Number Theory Algorithms\u003cbr\u003e 31.1 Basic number theory concepts\u003cbr\u003e 31.2 Greatest Common Divisor\u003cbr\u003e\u003cbr\u003e \u003cb\u003ePART 08 APPENDIX: MATHEMATICAL FOUNDATIONS\u003c\/b\u003e\u003cbr\u003e\u003cbr\u003e Appendix A Sum\u003cbr\u003e A.1 Sum formula and properties\u003cbr\u003e A.2 Limits of Agreement\u003cbr\u003e\u003cbr\u003e Appendix B Sets and Others\u003cbr\u003e B.1 Set\u003cbr\u003e B.2 Relationships\u003cbr\u003e B.3 Function\u003cbr\u003e B.4 Graph\u003cbr\u003e B.5 Tree\u003cbr\u003e\u003cbr\u003e Appendix C: Counting and Probability\u003cbr\u003e C.1 Count\u003cbr\u003e C.2 Probability\u003cbr\u003e C.3 Discrete random variables\u003cbr\u003e C.4 Geometric and Binomial Distributions\u003cbr\u003e C.5 Tails of the binomial distribution\u003cbr\u003e\u003cbr\u003e Appendix D Matrices\u003cbr\u003e D.1 Matrices and Matrix Operations\u003cbr\u003e D.2 Basic properties of matrices\u003c\/div\u003e\n\u003cdiv\u003e\u003c\/div\u003e\n\u003c\/div\u003e \",\"\u003cdiv\u003e\u003ch5\u003e \u003cb\u003eDetailed image\u003c\/b\u003e \u003c\/h5\u003e\u003c\/div\u003e\n\u003cdiv\u003e\u003cdiv\u003e\u003cimg src=\"https:\/\/image.yes24.com\/momo\/TopCate4598\/MidCate007\/459768652.jpg\" border=\"0\" alt=\"Detailed Image 1\"\u003e\u003c\/div\u003e\u003c\/div\u003e \"]\u003c\/div\u003e\n\n\n\u003c\/div\u003e\n\n\u003ccenter\u003e\u003ctable\u003e\u003ctr\u003e\u003ctd style=\"height:10px\"\u003e\u003c\/td\u003e\u003c\/tr\u003e\u003c\/table\u003e\u003c\/center\u003e\n\n\u003ccenter\u003e\u003ctable\u003e\u003ctr\u003e\u003ctd style=\"height:10px\"\u003e\u003c\/td\u003e\u003c\/tr\u003e\u003c\/table\u003e\u003c\/center\u003e\n\n\u003cdiv style=\"width:95%;padding-top:20px;padding-bottom:20px\"\u003e\n\n \u003cdiv style=\"text-align:left;font-size:16px;font-weight:bold;padding-bottom:20px\"\u003eGOODS SPECIFICS \u003c\/div\u003e\n\n\u003cdiv style=\"text-align:left;font-size:14px;line-height:1.6em;\"\u003e\n\n\u003cdiv style=\"width:100%;margin-bottom:5px;line-height:1.6em;font-size:14px\"\u003e - \u003cstrong\u003eDate of issue:\u003c\/strong\u003e July 1, 2024\u003c\/div\u003e\n\n\u003cdiv style=\"width:100%;margin-bottom:5px;line-height:1.6em;font-size:14px\"\u003e - \u003cstrong\u003eFormat:\u003c\/strong\u003e Hardcover book binding method guide\u003c\/div\u003e\n\n\u003cdiv style=\"width:100%;margin-bottom:5px;line-height:1.6em;font-size:14px\"\u003e - \u003cstrong\u003ePage count, weight, size:\u003c\/strong\u003e 1,336 pages | 2,412g | 197*265*50mm\u003c\/div\u003e\n\n\u003cdiv style=\"width:100%;margin-bottom:5px;line-height:1.6em;font-size:14px\"\u003e - \u003cstrong\u003eISBN13:\u003c\/strong\u003e 9791156640325\u003c\/div\u003e\n\n\u003cdiv style=\"width:100%;margin-bottom:5px;line-height:1.6em;font-size:14px\"\u003e - \u003cstrong\u003eISBN10:\u003c\/strong\u003e 1156640326 \u003c\/div\u003e\n\n\n\u003c\/div\u003e\n\n\n\u003c\/div\u003e\n\n\n\u003c\/div\u003e\n\n\u003ccenter\u003e\n\n\u003ccenter\u003e\u003ctable\u003e\u003ctr\u003e\u003ctd style=\"height:10px\"\u003e\u003c\/td\u003e\u003c\/tr\u003e\u003c\/table\u003e\u003c\/center\u003e\n\n\u003ccenter\u003e\u003ctable\u003e\u003ctr\u003e\u003ctd style=\"height:10px\"\u003e\u003c\/td\u003e\u003c\/tr\u003e\u003c\/table\u003e\u003c\/center\u003e\n\n\u003cspan\u003e\u003c\/span\u003e\n\n\u003c\/center\u003e\n\n\n\u003c\/center\u003e","brand":"LIBRAIRIE COREENNE","offers":[{"title":"Default Title","offer_id":43893332803626,"sku":"138956","price":86.0,"currency_code":"EUR","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0683\/2750\/5962\/files\/7a2e49a3134c8d980fbf67b626f23774.jpg?v=1765396675","url":"https:\/\/librairie.coreenne.fr\/en\/products\/138956","provider":"LIBRAIRIE COREENNE","version":"1.0","type":"link"}