Instructor Solutions to Accompany Introduction to Algorithms (4e) by Cormen

christopher_foo
(77)
Registrado como vendedor particular
Por tanto, no se aplican las normas de protección de los consumidores derivadas de la legislación de la UE en materia de consumidores. La Garantía al cliente de eBay sigue aplicando a la mayoría de compras. Más información
Otros artículos del vendedor
Contactar con el vendedor
USD409,99
Aproximadamente354,51 EUR
Estado:
Como nuevo
¡Corre antes de que se agote! 1 usuario tiene este artículo en seguimiento.
Envío:
USD90,00 (aprox. 77,82 EUR) USPS Media MailTM.
Ubicado en: Oklahoma, Brunei, Malaysia, Estados Unidos
Entrega:
Entrega prevista entre el sáb. 8 nov. y el sáb. 15 nov. a 94104
Las fechas previstas de entrega (se abre en una nueva ventana o pestaña) incluyen el tiempo de manipulación del vendedor, el código postal de origen, el código postal de destino y la hora de aceptación, y dependen del servicio de envío seleccionado y de que el pago se haya hecho efectivoel pago se haya hecho efectivo (se abre en una nueva ventana o pestaña). Los plazos de entrega pueden variar, especialmente en épocas de mucha actividad.
Devoluciones:
No se aceptan devoluciones.
Pagos:
    Diners Club

Compra con confianza

Garantía al cliente de eBay
Si no recibes el artículo que has pedido, te devolvemos el dinero. Más informaciónGarantía al cliente de eBay - se abre en una nueva ventana o pestaña
El vendedor asume toda la responsabilidad de este anuncio.
N.º de artículo de eBay:306514721949

Características del artículo

Estado
Como nuevo: Libro en perfecto estado y poco leído. La tapa no tiene desperfectos y si procede, con ...
ISBN
9780262046305
Categoría

Acerca de este producto

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

Descripción del artículo del vendedor

Acerca de este vendedor

christopher_foo

100% de votos positivos•37 artículos vendidos

Se unió el may 2006
Registrado como vendedor particularPor tanto, no se aplican los derechos de los consumidores derivados de las leyes de protección de los consumidores de la UE. La Garantía al cliente de eBay sigue aplicando a la mayoría de compras. Más informaciónMás información
Otros artículos del vendedorContactar

Votos del vendedor

Aún no hay votos