|Listed in category:
Have one to sell?

Introduction to Algorithms Fourth Edition by Charles E. Leiserson, Thomas H. Cor

US $64.99
Condition:
Brand New
Shipping:
Free Economy Shipping. See detailsfor shipping
Located in: Columbus, Ohio, United States
Delivery:
Estimated between Fri, May 31 and Tue, Jun 4 to 43230
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:
Seller does not accept returns. See details- for more information about returns
Payments:
      
Earn up to 5x points when you use your eBay Mastercard®. Learn moreabout earning points with eBay Mastercard

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:404825225197

Item specifics

Condition
Brand New: A new, unread, unused book in perfect condition with no missing or damaged pages. See the ...
Subject Area
Educational Technology
Educational Level
Adult & Further Education
Level
Advanced
Features
Illustrated, FOURTH EDITION
Country/Region of Manufacture
India
Subject
Education
ISBN
9780262046305
Publication Year
2022
Type
Textbook
Format
Hardcover
Language
English
Publication Name
Introduction to Algorithms, Fourth Edition
Item Height
2.2in
Author
Ronald L. Rivest, Charles E. Leiserson, Thomas H. Cormen, Clifford Stein
Item Length
9.3in
Publisher
MIT Press
Item Width
8.4in
Item Weight
78.7 Oz
Number of Pages
1312 Pages

About this product

Product Information

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.

Product Identifiers

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

Product Key Features

Author
Ronald L. Rivest, Charles E. Leiserson, Thomas H. Cormen, Clifford Stein
Publication Name
Introduction to Algorithms, Fourth Edition
Format
Hardcover
Language
English
Publication Year
2022
Type
Textbook
Number of Pages
1312 Pages

Dimensions

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

Additional Product Features

Lc Classification Number
Qa76.6.C662 2022
Edition Number
4
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
Topic
Programming / Algorithms, Computer Science, General, Référence
Lccn
2021-037260
Dewey Decimal
005.13
Intended Audience
Trade
Dewey Edition
23
Illustrated
Yes
Genre
Computers, Mathematics

Item description from the seller

horizon-enterprises

horizon-enterprises

100% positive feedback
71 items sold
Joined Aug 2023
Usually responds within 24 hours

Product ratings and reviews

4.5
2 product ratings
  • 1 users rated this 5 out of 5 stars
  • 1 users rated this 4 out of 5 stars
  • 0 users rated this 3 out of 5 stars
  • 0 users rated this 2 out of 5 stars
  • 0 users rated this 1 out of 5 stars

Would recommend

Good value

Compelling content

Most relevant reviews

  • Fast shipper. Item came exactly as described. Pagacking was acceptable but would have preferred slightly more protection to edges and spine of book.

    Fast shipper. Item came exactly as described. Pagacking was acceptable but would have preferred slightly more protection to edges and spine of book.

    Verified purchase: YesCondition: NewSold by: bettertobuy_60

  • "comprehensive book about algorithms"

    a good book, also as my reference book, helpful .

    Verified purchase: YesCondition: NewSold by: jonabooks