About this Course
The first matters on this a part of the specialization are: asymptotic (“Large-oh”) notation, sorting and looking out, divide and conquer (grasp methodology, integer and matrix multiplication, closest pair), and randomized algorithms (QuickSort, contraction algorithm for min cuts).
SKILLS YOU WILL GAIN
- Algorithms
- Randomized Algorithm
- Sorting Algorithm
- Divide And Conquer Algorithms
Syllabus – What you’ll be taught from this course
4 hours to finish
Week 1
Introduction; “big-oh” notation and asymptotic evaluation.
4 hours to finish
Week 2
Divide-and-conquer fundamentals; the grasp methodology for analyzing divide and conquer algorithms.
4 hours to finish
Week 3
The QuickSort algorithm and its evaluation; chance overview.
5 hours to finish
Week 4
Linear-time choice; graphs, cuts, and the contraction algorithm.
0 Comments