Picture 1 of 1
Picture 1 of 1
Introduction to Algorithms, Second Edition by Cormen, Thomas H|Leiserson, Cha…
US $21.90
ApproximatelyS$ 28.17
Condition:
“Satisfaction Guaranteed! 100% Money Back Guarantee.Book is in typical used-Good Condition. Will show ”... Read moreabout condition
Good
A book that has been read but is in good condition. Very minimal damage to the cover including scuff marks, but no holes or tears. The dust jacket for hard covers may not be included. Binding has minimal wear. The majority of pages are undamaged with minimal creasing or tearing, minimal pencil underlining of text, no highlighting of text, no writing in margins. No missing pages.
Postage:
US $3.97 (approx S$ 5.11) Economy Shipping.
Located in: Multiple Locations, United States
Delivery:
Estimated between Tue, 1 Oct and Fri, 4 Oct to 43230
Returns:
30 days return. Seller pays for return shipping.
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
Seller assumes all responsibility for this listing.
eBay item number:284247609828
Item specifics
- Condition
- Good
- Seller Notes
- ISBN
- 9780070131514
- Subject Area
- Mathematics, Computers
- Publication Name
- Introduction to Algorithms
- Publisher
- McGraw-Hill Higher Education
- Item Length
- 9.3 in
- Subject
- Programming / Algorithms, Algebra / General
- Publication Year
- 2001
- Type
- Textbook
- Format
- Hardcover
- Language
- English
- Item Height
- 2.3 in
- Item Weight
- 83.4 Oz
- Item Width
- 8.2 in
- Number of Pages
- 1056 Pages
About this product
Product Identifiers
Publisher
McGraw-Hill Higher Education
ISBN-10
0070131511
ISBN-13
9780070131514
eBay Product ID (ePID)
30505
Product Key Features
Number of Pages
1056 Pages
Publication Name
Introduction to Algorithms
Language
English
Subject
Programming / Algorithms, Algebra / General
Publication Year
2001
Type
Textbook
Subject Area
Mathematics, Computers
Format
Hardcover
Dimensions
Item Height
2.3 in
Item Weight
83.4 Oz
Item Length
9.3 in
Item Width
8.2 in
Additional Product Features
Edition Number
2
Intended Audience
College Audience
LCCN
2001-031277
Dewey Edition
22
Illustrated
Yes
Dewey Decimal
005.1
Table Of Content
Preface I Foundations 1 The Role of Algorithms in Computing 2 Getting Started 3 Growth of Functions 4 Recurrences 5 Probabilistic Analysis and Randomized Algorithms II Sorting and Order Statistics 6 Heapsort 7 Quicksort 8 Sorting in Linear Time 9 Medians and Order Statistics III Data Structures 10 Elementary Data Structures 11 Hash Table 12 Binary Search Trees 13 Red-Black Trees 14 Augmenting Data Structures IV Advanced Design and Analysis Techniques 15 Dynamic Programming 16 Greedy Algorithms 17 Amortized Analysis V Advanced Data Structures 18 B-Trees 19 Binomial Heaps 20 Fibonacci Heaps 21 Data Structures for Disjoint Sets VI Graph Algorithms 22 Elementary Graph Algorithms 23 Minimum Spanning Trees 24 Single-Source Shortest Paths 25 All-Pairs Shortest Paths 26 Maximum Flow VII Selected Topics 27 Sorting Networks 28 Matrix Operations 29 Linear Programming 30 Polynomials and the FFT 31 Number-Theoretic Algorithms 32 String Matching 33 Computational Geometry 34 NP-Completeness 35 Approximation Algorithms VIII Appendix: Mathematical Background A Summations B Sets, Etc. C Counting and Probability Bibliography Index (created by the authors)
Synopsis
The updated new edition of the classic Introduction to Algorithms is intended primarily for use in undergraduate or graduate courses in algorithms or data structures. Like the first edition, this text can also be used for self-study by technical professionals since it discusses engineering issues in algorithm design as well as the mathematical aspects. In its new edition, Introduction to Algorithms continues to provide a comprehensive introduction to the modern study of algorithms. The revision has been updated to reflect changes in the years since the book's original publication. New chapters on the role of algorithms in computing and on probabilistic analysis and randomized algorithms have been included. Sections throughout the book have been rewritten for increased clarity, and material has been added wherever a fuller explanation has seemed useful or new information warrants expanded coverage. As in the classic first edition, this new edition of Introduction to Algorithms presents a rich variety of algorithms and covers them in considerable depth while making their design and analysis accessible to all levels of readers. Further, the algorithms are presented in pseudocode to make the book easily accessible to students from all programming language backgrounds. Each chapter presents an algorithm, a design technique, an application area, or a related topic. The chapters are not dependent on one another, so the instructor can organize his or her use of the book in the way that best suits the course's needs. Additionally, the new edition offers a 25% increase over the first edition in the number of problems, giving the book 155 problems and over 900 exercises that reinforcethe concepts the students are learning.
LC Classification Number
QA76.6
Item description from the seller
Popular categories from this store
Seller feedback (4,278)
- o***i (293)- Feedback left by buyer.Past monthVerified purchaseExactly what I needed
- o***i (293)- Feedback left by buyer.Past monthVerified purchaseJust as described.
- a***0 (70)- Feedback left by buyer.Past monthVerified purchaseThe book came in exactly like the picture. Excellent.