| Sumario: | Algorithms, Deluxe Edition , Fourth Edition These Algorithms Video Lectures cover the essential information that every serious programmer needs to know about algorithms and data structures, with emphasis on applications and scientific performance analysis of Java implementations. Description This collection of video lectures provides a comprehensive exploration of fundamental data types, algorithms, and data structures, with an emphasis on applications and scientific performance analysis of Java implementations. The instructors offer readings related to these lectures that you can find in Algorithms , Fourth Edition , the leading textbook on algorithms today. These lectures provide another perspective on the material presented in the book and generally cover the material in the same order, though some book topics have been combined, rearranged, or omitted in the lectures. Don’t have the book? Purchase Algorithms , Deluxe Edition , which includes the print book and full access to the lecture videos. You also can find related resources on the instructors’ web site , including the following: Full Java implementations Test data Exercises and answers Dynamic visualizations Lecture slides Programming assignments with checklists Other links to related material About the Instructors Robert Sedgewick is the William O. Baker Professor of Computer Science at Princeton University. He is a Director of Adobe Systems and has served on the research staffs at Xerox PARC, IDA, and INRIA. He earned his PhD from Stanford University under Donald E. Knuth. Kevin Wayne also teaches in the Department of Computer Science at Princeton University. His research focuses on theoretical computer science, especially optimization and the design, analysis, and implementation of computer algorithms. Wayne received his PhD from Cornell University. Skill Level All Levels What You Will Learn These videos survey the most important computer algorithms in use today. The algorithms described in these lectures represent a body of knowledge developed of the last 50 years that has become indispensable. These lectures present: Implementations of useful algorithms Detailed information on performance characteristics Examples of clients and applications The early lectures cover our fundamental approach to studying algorithms, including data types for stacks, queues, and other low-level abstractions. Then we cover these major topics: Sorting algorithms, highlighting the classic Quicksort and ...
|
|---|
