Algorithms
Autor Robert Sedgewick, Kevin Wayneen Limba Engleză Hardback – 8 mar 2011
This fourth 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. 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, offered each fall and spring, 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.
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 state-of-the-art textbook, online content, and MOOC, they have built a unique resource that greatly expands the breadth and depth of the educational experience.
Preț: 486.00 lei
Preț vechi: 607.50 lei
-20% Nou
93.01€ • 96.61$ • 77.26£
Carte disponibilă
Livrare economică 13-27 ianuarie 25
Livrare express 27 decembrie 24 - 02 ianuarie 25 pentru 67.89 lei
Specificații
ISBN-10: 032157351X
Pagini: 992
Dimensiuni: 188 x 231 x 36 mm
Greutate: 1.63 kg
Ediția:Nouă
Editura: Addison-Wesley Professional
Locul publicării:Boston, United States
Cuprins
- 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 Sorts2.1 Elementary Sorts
- 2.2 Mergesort
- 2.3 Quicksort
- 2.4 Priority Queues
- 2.5 Applications
- Chapter 3: Searching
- 3.1 Symbol Tables3.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 graphs4.1 Undirected graphs
- 4.2 Directed graphs
- 4.3 Minimum Spanning Trees
- 4.4 Shortest Paths
- Chapter 5: Strings
- 5.1 String Sorts5.1 String Sorts
- 5.2 Tries
- 5.3 Substring Search
- 5.4 Regular Expressions
- 5.5 Data Compression
- Context
- Systems ProgrammingSystems Programming
- Scientific Computing
- Commercial Applications
- Operations Research
- Intractability
- Index
Notă biografică
Robert Sedgewick has been a Professor of Computer Science at Princeton University since 1985, where he was the founding Chairman of the Department of Computer Science. He has held visiting research positions at Xerox PARC, Institute for Defense Analyses, and INRIA, and is member of the board of directors of Adobe Systems. Professor Sedgewick's research interests include analytic combinatorics, design and analysis of data structures and algorithms, and program visualization. His landmark book, Algorithms, now in its fourth edition, has appeared in numerous versions and languages over the past thirty years. In addition, with Kevin Wayne, he is the coauthor of the highly acclaimed textbook, Introduction to Programming in Java: An Interdisciplinary Approach (Addison-Wesley, 2008).
Kevin Wayne is the Phillip Y. Goldman Senior Lecturer in Computer Science at Princeton University, where he has been teaching since 1998. He received a Ph.D. in operations research and industrial engineering from Cornell University. His research interests include the design, analysis, and implementation of algorithms, especially for graphs and discrete optimization. With Robert Sedgewick, he is the coauthor of the highly acclaimed textbook, Introduction to Programming in Java: An Interdisciplinary Approach (Addison-Wesley, 2008).
Descriere
This fourth 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. 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, offered each fall and spring, 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.
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 state-of-the-art textbook, online content, and MOOC, they have built a unique resource that greatly expands the breadth and depth of the educational experience.