Introduction to Algorithms, fourth edition, Cormen, Thomas H.,Leiserson, Charles

US $75.00
ApproximatelyS$ 98.03
Condition:
Like New
LIKE NEW!!! Has a red or black remainder mark on bottom/exterior edge of pages.
More than 10 available
Breathe easy. Returns accepted.
Shipping:
Free Economy Shipping.
Located in: McKeesport, Pennsylvania, United States
Delivery:
Estimated between Tue, 25 Nov and Tue, 2 Dec to 94104
Delivery time is estimated using our proprietary method which is based on the buyer's proximity to the item location, the shipping service selected, the seller's shipping history, and other factors. Delivery times may vary, especially during peak periods.
Returns:
30 days return. Buyer pays for return shipping. If you use an eBay shipping label, it will be deducted from your refund amount.
Coverage:
Read item description or contact seller for details. See all detailsSee all details on coverage
(Not eligible for eBay purchase protection programmes)

Shop with confidence

Top Rated Plus
Trusted seller, fast shipping, and easy returns. Learn more- Top Rated Plus - opens in a new window or tab
Seller assumes all responsibility for this listing.
eBay item number:277518730076

Item specifics

Condition
Like New
A book in excellent condition. Cover is shiny and undamaged, and the dust jacket is included for hard covers. No missing or damaged pages, no creases or tears, and no underlining/highlighting of text or writing in the margins. May be very minimal identifying marks on the inside cover. Very minimal wear and tear. See all condition definitionsopens in a new window or tab
Seller Notes
“LIKE NEW!!! Has a red or black remainder mark on bottom/exterior edge of pages.”
ISBN
9780262046305
Category

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

bellwetherbooks_usa

99.7% positive feedback805K items sold

Joined May 2007
Bellwetherbookstore.com© is among the largest & most reputable bargain book online retailers in the U.S. We specialize in the sale of the "hurt or return" and overstock books of the leading ...
See more

Detailed Seller Ratings

Average for the last 12 months
Accurate description
4.9
Reasonable shipping cost
5.0
Shipping speed
5.0
Communication
5.0

Popular categories from this store

Seller feedback (246,183)

All ratingsselected
Positive
Neutral
Negative
  • s***a (24)- Feedback left by buyer.
    Past 6 months
    Verified purchase
    I purchased multiple books from this seller, and this was a great experience! Each book was listed at a great price! Everything was shipped out quickly, and arrived only a few days after that. The book was packaged appropriately as well. The condition of the book was even better than what was listed, as it looked almost brand new, rather than the “very good” that was stated. I absolutely would buy from this seller again!
  • b***b (225)- Feedback left by buyer.
    Past 6 months
    Verified purchase
    This is a bookseller you can rely on. Paper Cuts is not my first purchase from them & they never let me down. Everything about them is positive. This book is brand new (!), even though it was listed as like new. Literally, brand new! They may have listed it as such due to the remainder mark - so slight it looks like a red dot. The quality, value and appearance of 'Paper Cuts' - all 5 (out of 5) stars. Great, strong, secure packaging. Book arrived on time. THANK YOU bellwetherbooks_usa!
  • e***0 (164)- Feedback left by buyer.
    Past 6 months
    Verified purchase
    This seller offered a discount if purchasing more than one book which was phenomenal. Books are like new as stated. Shipping was quick. Packaging was in a cardboard mailer which definitely protected these books throughout their postal journey. These were purchased as gifts. Thanks to this very conscientious seller.