Well researched. Topics covered well, with walkthrough for exam.le cases for each new introduced algorithm. Great experience, learned a lot of important algorithms and algorithmic thinking practices.
Thank you for teaching me this course. I learned a lot of new things, including Divide-and-Conquer, MergeSort, QuickSort, and Randomization Algorithms, along with proof for their asymptotic runtime
Very good, Assignment and Quiz. It's help me lot of to clear Concept.
par Fatoumata F•
I loved the problem set 1!
Thanks for the book recommendations also
par Hassan N•
Great course but audio and video are terribly out of sync.
par Георгий Г•
Retake videos, because it's hard to watching handwriting.
par sherif s•
over all is good
the proofs parts are too much by the way
Sometimes it became complicated but it was really good
par Yang W•
very conceptual, not very friendly to the beginner.
par Utsav S•
excellent ,what i most need was asymptotic analysis
par Anish K•
Very fun, interactive and downright helpful course.
par Yasir M•
Should be more precise in code. It's too vague
par Dragonphy W•
It's good enough but lack of thorough analysis
par Yash K•
Requires a bit of Math background for proofs!
par Simon R•
Interesting and well explained. Well done.
par Deepika G•
Loved the content and detailed lectures.
par Toader A•
Mentor help is almost non-existent.
par Dipankar m•
Very nice course with good faculty.
par de P S•
interesting and challenging course
par Artem S•
Sometimes too much mathematics.
par Abhilash R•
MORE OF THEORY LESS OF SOLVING
par Michael L•
This course is excellent...
par Shouvik G•
good.but, he is so fast!
par Tejas P•
well explained sir..!!!
par Tabrez M•
par 张之晗(ZhiHan Z•
par Shuvro C D•