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).
Ce cours fait partie de la Spécialisation Algorithmes
Offert par
À propos de ce cours
Compétences que vous acquerrez
- Algorithms
- Randomized Algorithm
- Sorting Algorithm
- Divide And Conquer Algorithms
Offert par
Programme de cours : ce que vous apprendrez dans ce cours
Week 1
Week 2
Week 3
Week 4
Avis
- 5 stars83,05 %
- 4 stars13,65 %
- 3 stars1,83 %
- 2 stars0,57 %
- 1 star0,87 %
Meilleurs avis pour DIVIDE AND CONQUER, SORTING AND SEARCHING, AND RANDOMIZED ALGORITHMS
This course is awesome and a bit challenging. The special part is about the problem quizzes which is about the running time analyses of the algorithms. And the professor is superb :-)
This course was outstanding! Big thanks to Tim for explaining difficult concepts in a clear and concise fashion. I can't wait to get started on the next course in this specialization!
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
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.
À propos du Spécialisation Algorithmes

Foire Aux Questions
Quand aurai-je accès aux vidéos de cours et aux devoirs ?
À quoi ai-je droit si je m'abonne à cette Spécialisation ?
Une aide financière est-elle possible ?
D'autres questions ? Visitez le Centre d'Aide pour les Étudiants.