Divide and Conquer, Sorting and Searching, and Randomized Algorithms free videos and free material uploaded by Coursera. This session contains about Divide and Conquer, Sorting and Searching, and Randomized Algorithms Updated syllabus , Lecture notes , videos , MCQ , Privious Question papers and Toppers Training Provided Training of this course. If Material not uploaded check another subject
Week 1
Introduction; "big-oh" notation and asymptotic analysis.
Week 2
Divide-and-conquer basics; the master method for analyzing divide and conquer algorithms.
Week 3
The QuickSort algorithm and its analysis; probability review.
Week 4
Linear-time selection; graphs, cuts, and the contraction algorithm.
The primary topics in this part of the specialization are: asymptotic ("Big-oh") notation, sorting and searching, divide and conquer (master method, integer and matrix multiplication, closest pair), and randomized algorithms (QuickSort, contraction algorithm for min cuts).
- 0 Reviews
- 4 Students
- 102 Courses
Write a public review