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. People who are interested in digging deeper into the content may wish to obtain the textbook Analysis of Algorithms, Second Edition (upon which the course is based) or to visit the website aofa.cs.princeton.edu for a wealth of additional material. This course does not offer a certificate upon completion.
SS
was really good, understood the importance of analysis of algorithms
NL
I would highly recommend this course to any developer to understand algorithm analysis.
NP
Outstanding material, brilliantly conceived! It contains the essence of mathematics necessary for anyone serious about programming.
AK
if it is also avilible in hindi lanaguage , then we can understand more.
DY
Such a Insightful course on algorithm analysis, this really improved my problem-solving skills significantly. Thank you !!
HA
It was a phenomenal Experience to be a part of this course learned a lot "THANKS TO THE CREATOR OF THIS COURSE"
SS
good course to learn but can have more explanation of topics.
AS
This Course was very much helpful for me to learn about Analysis of algorithm.
MJ
it was nice learning but at some points it was difficult to understand at all, so had to watch multiple times
FF
Analysis of algorithmsCombinatorial structuresAnalysis of combinatorial data structuresAsymptotic approximations
SR
good for learning Algorithm basics still a lil bit tough if you try the exercises on your own
HL
This is great course if you already done some algorithms courses and want to go deeper.
Showing: 20 of 315
This course is more about mathematic than algorithms, it teaches how to solve tricky combinatorial problems
This is great course if you already done some algorithms courses and want to go deeper.
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.
The good thing about Coursera is that the courses are self-contained with defined prerequisites but this course is definitely not self-contained and it also doesn't mention any prerequisites. It can be a good extra material following through a class, or attending the same lectures. This course is essentially the lectures from this class but without any supporting material or small group tutorials. Other than that, it's just a promotion of the books that the lecturer wrote.
I didn't like this course at all. Cover less material, but explain it better. Most of the students drop out after week 3.
算法3
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.
I enjoyed problems given in the quizzes. The course is one of the best presentations I have seen.
Excellent course, great exercise in combinatorics.
This course is very helpfull!
Doesn't offer ceritifcate
I have very much enjoyed taking this course. I think that professor Sedgewick does an excellent job making this material accessible at a deep level. His lectures and videos helped me develop a much deeper understanding of this material than I would have if I had just read the accompanying books.
clear explanation, and amazing tools to analyze algorithms through a scientific approach.
good
The course was good, but the teaching style was not for me so had to take a lot of help and use some guesswork
The instructor have to reissue the video according to the general aspect of solving the algorithms because there have no clear understanding of solving the approximate value of a given function in the questions. the teacher have my respect for developing algorithms with his friend but his way of teaching still bugs me on the concept
Tough
no certificate
If you're interested in the theoretical aspects of algorithms and want to gain a deep understanding of how they perform mathematically, this is a fantastic course. However, if you're looking for a more coding-oriented or applied algorithms course, you might want to pair this with a more practical course like Algorithms, Part I & II by Princeton University on Coursera.
Excellent material and instruction, and the course readings do require matematical sophistication. The biggest disappointment was the comments in the discussion forums, example: "good", "benefitable", etc.. The forum comments are not a reflection on the quality of the course, but a direct commentary on the people who are wasting everyone's time.