This course covers 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. Part I covers elementary data structures, sorting, and searching algorithms. Part II focuses on graph- and string-processing algorithms.
Princeton University is a private research university located in Princeton, New Jersey, United States. It is one of the eight universities of the Ivy League, and one of the nine Colonial Colleges founded before the American Revolution.
- 5 stars
- 4 stars
- 3 stars
- 2 stars
- 1 star
Pretty challenging course, but very good. Having a book is a must (at least it was for me), video lectures complement book nicely, and some topics are explained better in the Algorithms, 4th ed. book.
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.
The algorithms are more difficult than part I, nevertheless Sedgewick's vids are still easy to understand. The only drawback maybe chapter 3, max flow min cut part, which is not very clarified.
Amazing course! Loved the theory and exercises! Just a note for others: Its part 1 had almost no dependency on book, but this part 2 has some dependency (e.g. chapter on Graph) on book as well.
Do I need to pay for this course?
Can I earn a certificate in this course?
I have no familiarity with Java programming. Can I still take this course?
Which algorithms and data structures are covered in this course?
What kinds of assessments are available in this course?
I am/was not a Computer Science major. Is this course for me?
How does this course differ from Design and Analysis of Algorithms?