Part I Course Syllabus Week 1: Introduction. Asymptotic analysis including big-oh notation. Divide-and-conquer algorithms for sorting, counting inversions, matrix multiplication, and closest pair. Week 2: Running time analysis of divide-and-conquer algorithms. The master method. Introduction to randomized algorithms, with a probability review. QuickSort. Week 3: More on randomized algorithms and probability. Computing the median in […]
The post Coursera – Design and Analysis of Algorithms I+II appeared first on Get Tutorials & Training | Tut4DL.