Algorithms (4th Edition) - Hardcover, by Sedgewick Robert; Wayne - Very Good
43,20 $US43,20 $US
mar., août 19, 02:49 PMmar., août 19, 02:49 PM
Photo 1 sur 1
Galerie
Photo 1 sur 1
Vous en avez un à vendre?
Algorithms (4th Edition) - Hardcover, by Sedgewick Robert; Wayne - Very Good
43,20 $US
Environ60,52 $C
Était 54,00 $US (20 % de rabais)
État :
Terminé : août 19, 2025 14:49:33 HAE
Oops! Looks like we're having trouble connecting to our server.
Refresh your browser window to try again.
Expédition :
Sans frais USPS Media MailTM.
Lieu : Seattle, Washington, États-Unis
Livraison :
Livraison prévue entre le jeu. 6 nov. et le mer. 12 nov. à 94104
Renvois :
Renvoi sous 30 jours. L'acheteur paie les frais de renvoi. Si vous utilisez une étiquette d'envoi eBay, son coût sera déduit du montant de votre remboursement.
Paiements :
Magasinez en toute confiance
Le vendeur assume l'entière responsabilité de cette annonce.
Numéro de l'objet eBay :197548291036
Caractéristiques de l'objet
- État
- Book Title
- Algorithms (4th Edition)
- ISBN
- 9780321573513
À propos de ce produit
Product Identifiers
Publisher
Addison Wesley Professional
ISBN-10
032157351X
ISBN-13
9780321573513
eBay Product ID (ePID)
15038301573
Product Key Features
Number of Pages
976 Pages
Language
English
Publication Name
Algorithms
Publication Year
2011
Subject
Programming / Algorithms, Algebra / General, Software Development & Engineering / Systems Analysis & Design
Type
Textbook
Subject Area
Mathematics, Computers
Format
Hardcover
Dimensions
Item Height
1.7 in
Item Weight
57.1 Oz
Item Length
9.2 in
Item Width
7.4 in
Additional Product Features
Edition Number
4
Intended Audience
Scholarly & Professional
LCCN
2011-000707
Dewey Edition
23
Illustrated
Yes
Dewey Decimal
005.1
Table Of Content
Chapter 1: Fundamentals 1.1 Programming Model 1.2 Data Abstraction 1.3 Queues, Stacks, and Bags 1.4 Analysis of Algorithms 1.5 Case Study: Union-Find Chapter 2: Sorting 2.1 Elementary Sorts 2.1 Elementary Sorts 2.2 Mergesort 2.3 Quicksort 2.4 Priority Queues 2.5 Applications Chapter 3: Searching 3.1 Symbol Tables 3.1 Symbol Tables 3.2 Binary Search Trees 3.3 Balanced Search Trees 3.4 Hash Tables 3.5 Applications Chapter 4: Graphs 4.1 Undirected graphs 4.1 Undirected graphs 4.2 Directed graphs 4.3 Minimum Spanning Trees 4.4 Shortest Paths Chapter 5: Strings 5.1 String Sorts 5.1 String Sorts 5.2 Tries 5.3 Substring Search 5.4 Regular Expressions 5.5 Data Compression Context Systems Programming Systems Programming Scientific Computing Commercial Applications Operations Research Intractability Index
Synopsis
This fourth edition of Robert Sedgewick and Kevin Wayne's Algorithms is the leading textbook on algorithms today and is widely used in colleges and universities worldwide. This book surveys the most important computer algorithms currently in use and provides a full treatment of data structures and algorithms for sorting, searching, graph processing, and string processing--including fifty algorithms every programmer should know. In this edition, new Java implementations are written in an accessible modular programming style, where all of the code is exposed to the reader and ready to use. The algorithms in this book represent a body of knowledge developed over the last 50 years that has become indispensable, not just for professional programmers and computer science students but for any student with interests in science, mathematics, and engineering, not to mention students who use computation in the liberal arts. The companion web site, algs4.cs.princeton.edu, contains An online synopsis Full Java implementations Test data Exercises and answers Dynamic visualizations Lecture slides Programming assignments with checklists Links to related material The MOOC related to this book is accessible via the "Online Course" link at algs4.cs.princeton.edu. The course offers more than 100 video lecture segments that are integrated with the text, extensive online assessments, and the large-scale discussion forums that have proven so valuable. Offered each fall and spring, this course regularly attracts tens of thousands of registrants. Robert Sedgewick and Kevin Wayne are developing a modern approach to disseminating knowledge that fully embraces technology, enabling people all around the world to discover new ways of learning and teaching. By integrating their textbook, online content, and MOOC, all at the state of the art, they have built a unique resource that greatly expands the breadth and depth of the educational experience., The leading introduction to computer algorithms in use today, including fifty algorithms every programmer should know Princeton Computer Science professors, Robert Sedgewick and Kevin Wayne, survey the most important computer algorithms in use and of interest to anyone working in science, mathematics, and engineering, and those who use computation in the liberal arts. They provide a full treatment of data structures and algorithms for key areas that enable you to confidently implement, debug, and put them to work in any computational environment. Fundamentals: Basic programming models Data abstraction Bags, queues, and stacks Analysis of algorithms Sorting Elementary sorts Mergesort Quicksort Priority queues Applications Graphs Undirected graphs Directed graphs Minimum spanning trees Shortest paths Strings String sorts Tries Substring search Regular expressions Data compression These algorithms are generally ingenious creations that, remarkably, can each be expressed in just a dozen or two lines of code. As a group, they represent problem-solving power of amazing scope. They have enabled the construction of computational artifacts, the solution of scientific problems, and the development of commercial applications that would not have been feasible without them., This fourth edition of Robert Sedgewick and Kevin Wayne's Algorithms is the leading textbook on algorithms today and is widely used in colleges and universities worldwide. This book surveys the most important computer algorithms currently in use and provides a full treatment of data structures and algorithms for sorting, searching, graph processing, and string processing--including fifty algorithms every programmer should know. In this edition, new Java implementations are written in an accessible modular programming style, where all of the code is exposed to the reader and ready to use. The algorithms in this book represent a body of knowledge developed over the last 50 years that has become indispensable, not just for professional programmers and computer science students but for any student with interests in science, mathematics, and engineering, not to mention students who use computation in the liberal arts. The companion web site, algs4.cs.princeton.edu, contains An online synopsis Full Java implementations Test data Exercises and answers Dynamic visualizations Lecture slides Programming assignments with checklists Links to related material The MOOC related to this book is accessible via the Online Course link at algs4.cs.princeton.edu. The course offers more than 100 video lecture segments that are integrated with the text, extensive online assessments, and the large-scale discussion forums that have proven so valuable. Offered each fall and spring, this course regularly attracts tens of thousands of registrants. Robert Sedgewick and Kevin Wayne are developing a modern approach to disseminating knowledge that fully embraces technology, enabling people all around the world to discover new ways of learning and teaching. By integrating their textbook, online content, and MOOC, all at the state of the art, they have built a unique resource that greatly expands the breadth and depth of the educational experience., This edition of Robert Sedgewick and Kevin Wayne's Algorithms is one of the most popular textbooks on algorithms today and is widely used in colleges and universities worldwide. The algorithms in this book - including 50 algorithms every programmer should know - represent a body of knowledge developed over the last 50 years that has become indispensable, not just for professional programmers and computer science students but for any student with interests in science, mathematics, and engineering and for students who use computation in the liberal arts. In this edition, new Java implementations are written in an accessible modular programming style, where all of the code is exposed to the reader and ready to use.
LC Classification Number
QA76.9.A43
Description de l'objet du vendeur
Catégories populaires de cette Boutique
Évaluations comme vendeur (3 282)
Cet objet (1)
Tous les objets (3 282)
- Évaluations automatiques d'eBay- Évaluation laissée par l'acheteur.Six derniers moisCommande livrée dans les délais et sans problème
- m***g (46)- Évaluation laissée par l'acheteur.Dernier moisAchat vérifiéI needed the suitcase quickly before flying abroad and the seller was very responsive and accomodating to make sure it got to be me as soon as possible. Packaging was very safe/ssturdy and item was as described. Great value for the price.
- 3***3 (2)- Évaluation laissée par l'acheteur.Six derniers moisAchat vérifiéThe item arrived safely and as photographed. I had ordered another of the same the week prior that had broken in shipment and the seller refunded me promptly and let me know they had another of the same if I wanted to re-order. I ordered another and this one arrived safely and I am very pleased with my purchase.
- g***m (118)- Évaluation laissée par l'acheteur.Dernier moisAchat vérifiéExactly was they showed! Quick delivery! Great ebayer! Would definitely buy from them again! Packaging well protected the item and it was a good value!
Évaluations et avis sur le produit
Avis les plus pertinents
- févr. 15, 2023
Important for Computer Science students
Achat vérifié : OuiÉtat : NeufVendu par : mjcmicrodevel
- févr. 04, 2019
Good stuff for a reasonable price
Achat vérifié : OuiÉtat : NeufVendu par : textsupply
- févr. 04, 2022
Get this book!
Achat vérifié : OuiÉtat : OccasionVendu par : seruzu-47