Latest Courses
ISTQB Artificial Intelligence Tester Sample ExamsCheck course
JAVA Programming Online Practice ExamCheck course
Programming for Kids and Beginners: Learn to Code in PythonCheck course
Practice Exams | Codeigniter 4 developer certificationCheck course
WordPress Practice Tests & Interview Questions (Basic/Adv)Check course
Git &Github Practice Tests & Interview Questions (Basic/Adv)Check course
Machine Learning and Deep Learning for Interviews & ResearchCheck course
Laravel | Build Pizza E-commerce WebsiteCheck course
101 - F5 CERTIFICATION EXAMCheck course
Master Python by Practicing 100 QuestionCheck course
ISTQB Artificial Intelligence Tester Sample ExamsCheck course
JAVA Programming Online Practice ExamCheck course
Programming for Kids and Beginners: Learn to Code in PythonCheck course
Practice Exams | Codeigniter 4 developer certificationCheck course
WordPress Practice Tests & Interview Questions (Basic/Adv)Check course
Add to wishlistAdded to wishlistRemoved from wishlist 0
Add to compare
9.0/10 (Our Score)
Product is rated as #22 in category Data Structures and Algorithms

This course teaches a calculus that enables precise quantitative predictions of large combinatorial structures. In addition, this course covers generating functions and real asymptotics and then introduces the symbolic method in the context of applications in the analysis of algorithms and basic structures such as permutations, trees, strings, words, and mappings. All the features of this course are available for free. It does not offer a certificate upon completion. 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.

Instructor Details

Robert Sedgewick is the William O. Baker Professor of Computer Science at Princeton, where he was the founding chair of the Department of Computer Science. He received the Ph.D. degree from Stanford University, in 1975. Prof. Sedgewick also served on the faculty at Brown University and has held visiting research positions at Xerox PARC, Palo Alto, CA, Institute for Defense Analyses, Princeton, NJ, and INRIA, Rocquencourt, France. He is a member of the board of directors of Adobe Systems. Prof. Sedgewick's interests are in analytic combinatorics, algorithm design, the scientific analysis of algorithms, curriculum development, and innovations in the dissemination of knowledge. He has published widely in these areas and is the author of several books.

Specification: Analysis of Algorithms

Duration

22 hours

Year

2018

Level

Expert

Certificate

Yes

Quizzes

Yes

7 reviews for Analysis of Algorithms

4.6 out of 5
5
1
1
0
0
Write a review
Show all Most Helpful Highest Rating Lowest Rating
  1. Hafidz J L

    This is great course if you already done some algorithms courses and want to go deeper.

    Helpful(1) Unhelpful(0)You have already voted this
  2. Konstantin

    I didn’t like this course at all. Cover less material, but explain it better. Most of the students drop out after week 3.

    Helpful(0) Unhelpful(0)You have already voted this
  3. Andriy K

    This course is more about mathematic than algorithms, it teaches how to solve tricky combinatorial problems

    Helpful(1) Unhelpful(0)You have already voted this
  4. Ivan F

    This course offers an extensive coverage of mathematical material like tools and techniques, putting special emphasis on simple principles and never losing its focus on the general perspective of the topic. Developing insight on analytic functions together with combinatorics and the practical applications of theory into code gives a significant advantage over using naive approaches. A special appreciation to Prof. Sedgewick’s endless efforts for disseminating mathematical knowledge among programmers, over this platform and even outside! Thank you very much.

    Helpful(0) Unhelpful(0)You have already voted this
  5. HelloIsJeffrey

    This course is very helpfull!

    Helpful(0) Unhelpful(0)You have already voted this
  6. Zhenwei L

    Some of the problems are very interesting and I’m quite impressed by the symbolic method. Howerver, part of the contents are too “detailed” which is dull in my opinion.

    Helpful(0) Unhelpful(0)You have already voted this
  7. Madhav N W

    Excellent course, great exercise in combinatorics.

    Helpful(0) Unhelpful(0)You have already voted this

    Add a review

    Your email address will not be published. Required fields are marked *

    This site uses Akismet to reduce spam. Learn how your comment data is processed.

    Price tracking

    Java Code Geeks
    Logo
    Register New Account
    Reset Password
    Compare items
    • Total (0)
    Compare