|Listed in category:
This listing sold on Sat, 21 Jun at 4:33 AM.
Introduction to Algorithms, fourth edition (English, Hardcover) Brand New Book
Sold
Introduction to Algorithms, fourth edition (English, Hardcover) Brand New Book
US $52.00US $52.00
Sun, 22 Jun, 04:33Sun, 22 Jun, 04:33
Have one to sell?

Introduction to Algorithms, fourth edition (English, Hardcover) Brand New Book

Twisted Discount
(1267)
Registered as a private seller
Consumer protection regulations resulting from EU consumer law are therefore not applicable. eBay buyer protection still applies to most purchases.
US $52.00
ApproximatelyEUR 45.59
Condition:
New
    Postage:
    Free USPS Media MailTM.
    Located in: Moundsville, West Virginia, United States
    Delivery:
    Estimated between Sat, 2 Aug and Thu, 7 Aug to 94104
    Delivery time is estimated using our proprietary method which is based on the buyer's proximity to the item location, the delivery service selected, the seller's delivery history and other factors. Delivery times may vary, especially during peak periods.
    Returns:
    30 days return. Seller pays for return postage.
    Payments:
        Diners Club

    Shop with confidence

    eBay Money Back Guarantee
    Get the item you ordered or your money back. Learn moreeBay Money Back Guarantee - opens new window or tab
    Seller assumes all responsibility for this listing.
    eBay item number:388597029364

    Item specifics

    Condition
    New: A new, unread, unused book in perfect condition with no missing or damaged pages. See the ...
    Series
    Addison-Wesley Professional Computing Ser.
    ISBN
    9780262046305

    About this product

    Product Identifiers

    Publisher
    MIT Press
    ISBN-10
    026204630X
    ISBN-13
    9780262046305
    eBay Product ID (ePID)
    18050031277

    Product Key Features

    Number of Pages
    1312 Pages
    Publication Name
    Introduction to Algorithms, Fourth Edition
    Language
    English
    Subject
    Programming / Algorithms, Reference, Computer Science, General
    Publication Year
    2022
    Type
    Textbook
    Author
    Ronald L. Rivest, Charles E. Leiserson, Thomas H. Cormen, Clifford Stein
    Subject Area
    Mathematics, Computers
    Format
    Hardcover

    Dimensions

    Item Height
    2.2 in
    Item Weight
    78.7 Oz
    Item Length
    9.3 in
    Item Width
    8.4 in

    Additional Product Features

    Edition Number
    4
    Intended Audience
    Trade
    LCCN
    2021-037260
    Dewey Edition
    23
    Illustrated
    Yes
    Dewey Decimal
    005.13
    Table Of Content
    Preface xiii I Foundations Introduction 3 1 The Role of Algorithms in Computing 5 2 Getting Started 17 3 Characterizing Running Times 49 4 Divide-and-Conquer 76 5 Probabilistic Analysis and Randomized Algorithms 126 II Sorting and Order Statistics Introduction 157 6 Heapsort 161 7 Quicksort 182 8 Sorting in Linear Time 205 9 Medians and Order Statistics 227 III Data Structures Introduction 249 10 Elementary Data Structures 252 11 Hash Tables 272 12 Binary Search Trees 312 12 Red-Black Trees 331 IV Advanced Design and Analysis Techniques Introduction 361 14 Dynamic Programming 362 15 Greedy Algorithms 417 16 Amortized Analysis 448 V Advanced Data Structures Introduction 477 17 Augmenting Data Structures 480 18 B-Trees 497 19 Data Structures for Disjoint Sets 520 VI Graph Algorithms Introduction 547 20 Elementary Graph Algorithms 549 21 Minimum Spanning Trees 585 22 Single-Source Shortest Paths 604 23 All-Pairs Shortest Paths 646 24 Maximum Flow 670 25 Matchings in Bipartite Graphs 704 VII Selected Topics Introduction 745 26 Parallel Algorithms 748 27 Online Algorithms 791 28 Matrix Operations 819 29 Linear Programming 850 30 Polynomials and the FFT 877 31 Number-Theoretic Algorithms 903 32 String Matching 957 33 Machine-Learning Algorithms 1003 34 NP-Completeness 1042 35 Approximation Algorithms 1104 VIII Appendix: Mathematical Background Introduction 1139 A Summations 1140 B Sets, Etc. 1153 C Counting and Probability 1178 D Matrices 1214 Bibliography 1227 Index 1251
    Synopsis
    A comprehensive update of the leading algorithms text, with new material on matchings in bipartite graphs, online algorithms, machine learning, and other topics. Some books on algorithms are rigorous but incomplete; others cover masses of material but lack rigor. Introduction to Algorithms 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, Introduction to Algorithms has become the leading algorithms text in universities worldwide as well as the standard reference for professionals. This fourth edition has been updated throughout. New for the fourth edition - New chapters on matchings in bipartite graphs, online algorithms, and machine learning - New material on topics including solving recurrence equations, hash tables, potential functions, and suffix arrays - 140 new exercises and 22 new problems - Reader feedback-informed improvements to old problems - Clearer, more personal, and gender-neutral writing style - Color added to improve visual presentation - Notes, bibliography, and index updated to reflect developments in the field - Website with new supplementary material, A comprehensive update of the leading algorithms text, with new material on matchings in bipartite graphs, online algorithms, machine learning, and other topics. Some books on algorithms are rigorous but incomplete; others cover masses of material but lack rigor. Introduction to Algorithms 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, Introduction to Algorithms has become the leading algorithms text in universities worldwide as well as the standard reference for professionals. This fourth edition has been updated throughout. New for the fourth edition New chapters on matchings in bipartite graphs, online algorithms, and machine learning New material on topics including solving recurrence equations, hash tables, potential functions, and suffix arrays 140 new exercises and 22 new problems Reader feedback-informed improvements to old problems Clearer, more personal, and gender-neutral writing style Color added to improve visual presentation Notes, bibliography, and index updated to reflect developments in the field Website with new supplementary material Warning- Avoid counterfeit copies of Introduction to Algorithms by buying only from reputable retailers. Counterfeit and pirated copies are incomplete and contain errors.
    LC Classification Number
    QA76.6.C662 2022

    Item description from the seller

    About this seller

    Twisted Discount

    100% positive Feedbackβ€’4.0K items sold

    Joined Jul 2016
    Usually responds within 24 hours
    Registered as a private sellerThereby, consumer rights stemming from EU consumer protection law do not apply. eBay buyer protection still applies to most purchases.

    Detailed seller ratings

    Average for the last 12 months
    Accurate description
    5.0
    Reasonable postage cost
    4.8
    Delivery time
    5.0
    Communication
    5.0

    Seller Feedback (1,290)

    All ratings
    Positive
    Neutral
    Negative
    • j***b (8)- Feedback left by buyer.
      Past 6 months
      Verified purchase
      Quality is as good as advertised. Solid condition and received at less than half of its retail value. Good seller.
    See all Feedback