{"product_id":"introduction-to-algorithms-fourth-edition-isbn-9780262046305","title":"Introduction to Algorithms, fourth edition","description":"\u003cb\u003eA comprehensive update of the leading algorithms text, with new material on matchings in bipartite graphs, online algorithms, machine learning, and other topics.\u003c\/b\u003e\u003cbr\u003e\u003cbr\u003eSome books on algorithms are rigorous but incomplete; others cover masses of material but lack rigor. \u003ci\u003eIntroduction to Algorithms\u003c\/i\u003e uniquely combines rigor and comprehensiveness. It covers a broad range of algorithms in depth, yet makes their design and analysis accessible to all levels of readers, with self-contained chapters and algorithms in pseudocode. Since the publication of the first edition, \u003ci\u003eIntroduction to Algorithms\u003c\/i\u003e has become the leading algorithms text in universities worldwide as well as the standard reference for professionals. This fourth edition has been updated throughout.\u003cbr\u003e\u003cbr\u003e\u003cu\u003eNew for the fourth edition \u003c\/u\u003e \u003cbr\u003e\u003cul\u003e\u003cli\u003eNew chapters on matchings in bipartite graphs, online algorithms, and machine learning\u003c\/li\u003e\u003c\/ul\u003e\u003cul\u003e\u003cli\u003eNew material on topics including solving recurrence equations, hash tables, potential functions, and suffix arrays\u003c\/li\u003e\u003c\/ul\u003e\u003cul\u003e\u003cli\u003e140 new exercises and 22 new problems\u003c\/li\u003e\u003c\/ul\u003e\u003cul\u003e\u003cli\u003eReader feedback–informed improvements to old problems\u003c\/li\u003e\u003c\/ul\u003e\u003cul\u003e\u003cli\u003eClearer, more personal, and gender-neutral writing style\u003c\/li\u003e\u003c\/ul\u003e\u003cul\u003e\u003cli\u003eColor added to improve visual presentation\u003c\/li\u003e\u003c\/ul\u003e\u003cul\u003e\u003cli\u003eNotes, bibliography, and index updated to reflect developments in the field\u003c\/li\u003e\u003c\/ul\u003e\u003cul\u003e\u003cli\u003eWebsite with new supplementary material\u003c\/li\u003e\u003c\/ul\u003e\u003cbr\u003e\u003cu\u003eWarning:\u003c\/u\u003e Avoid counterfeit copies of \u003ci\u003eIntroduction to Algorithms\u003c\/i\u003e by buying only from reputable retailers. Counterfeit and pirated copies are incomplete and contain errors.Preface xiii\u003cbr\u003eI Foundations\u003cbr\u003eIntroduction 3\u003cbr\u003e1 The Role of Algorithms in Computing 5\u003cbr\u003e2 Getting Started 17\u003cbr\u003e3 Characterizing Running Times 49\u003cbr\u003e4 Divide-and-Conquer 76\u003cbr\u003e5 Probabilistic Analysis and Randomized Algorithms 126\u003cbr\u003eII Sorting and Order Statistics \u003cbr\u003eIntroduction 157\u003cbr\u003e6 Heapsort 161\u003cbr\u003e7 Quicksort 182\u003cbr\u003e8 Sorting in Linear Time 205\u003cbr\u003e9 Medians and Order Statistics 227\u003cbr\u003eIII Data Structures \u003cbr\u003eIntroduction 249\u003cbr\u003e10 Elementary Data Structures 252\u003cbr\u003e11 Hash Tables 272\u003cbr\u003e12 Binary Search Trees 312\u003cbr\u003e12 Red-Black Trees 331\u003cbr\u003eIV Advanced Design and Analysis Techniques \u003cbr\u003eIntroduction 361\u003cbr\u003e14 Dynamic Programming 362\u003cbr\u003e15 Greedy Algorithms 417\u003cbr\u003e16 Amortized Analysis 448\u003cbr\u003eV Advanced Data Structures\u003cbr\u003eIntroduction 477\u003cbr\u003e17 Augmenting Data Structures 480\u003cbr\u003e18 B-Trees 497\u003cbr\u003e19 Data Structures for Disjoint Sets 520\u003cbr\u003eVI Graph Algorithms \u003cbr\u003eIntroduction 547\u003cbr\u003e20 Elementary Graph Algorithms 549\u003cbr\u003e21 Minimum Spanning Trees 585\u003cbr\u003e22 Single-Source Shortest Paths 604\u003cbr\u003e23 All-Pairs Shortest Paths 646\u003cbr\u003e24 Maximum Flow 670\u003cbr\u003e25 Matchings in Bipartite Graphs 704\u003cbr\u003eVII Selected Topics\u003cbr\u003eIntroduction 745\u003cbr\u003e26 Parallel Algorithms 748\u003cbr\u003e27 Online Algorithms 791\u003cbr\u003e28 Matrix Operations 819\u003cbr\u003e29 Linear Programming 850\u003cbr\u003e30 Polynomials and the FFT 877\u003cbr\u003e31 Number-Theoretic Algorithms 903\u003cbr\u003e32 String Matching 957\u003cbr\u003e33 Machine-Learning Algorithms 1003\u003cbr\u003e34 NP-Completeness 1042\u003cbr\u003e35 Approximation Algorithms 1104\u003cbr\u003eVIII Appendix: Mathematical Background\u003cbr\u003eIntroduction 1139\u003cbr\u003eA Summations 1140\u003cbr\u003eB Sets, Etc. 1153\u003cbr\u003eC Counting and Probability 1178\u003cbr\u003eD Matrices 1214\u003cbr\u003eBibliography 1227\u003cbr\u003eIndex 1251\u003cb\u003eThomas H. Cormen\u003c\/b\u003e is Emeritus Professor of Computer Science at Dartmouth College. \u003cb\u003eCharles E. Leiserson\u003c\/b\u003e is Edwin Sibley Webster Professor in Electrical Engineering and Computer Science at MIT. \u003cb\u003eRonald L. Rivest\u003c\/b\u003e is Institute Professor at MIT. \u003cb\u003eClifford Stein\u003c\/b\u003e is Wai T. Chang Professor of Industrial Engineering and Operations Research, and of Computer Science at Columbia University.\u003cbr\u003e ","brand":"The MIT Press","offers":[{"title":"Default Title","offer_id":46304212615397,"sku":"NP9780262046305","price":150.0,"currency_code":"USD","in_stock":false}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/1842\/7735\/files\/9780262046305.jpg?v=1767730141","url":"https:\/\/k12savings.com\/es\/products\/introduction-to-algorithms-fourth-edition-isbn-9780262046305","provider":"K12savings","version":"1.0","type":"link"}