Avis et commentaires pour d'étudiants pour Divide and Conquer, Sorting and Searching, and Randomized Algorithms par Université de Stanford

KS

13 sept. 2018

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.

DT

26 mai 2020

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