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).
Este curso forma parte de Programa especializado: Algoritmos
Ofrecido Por
Acerca de este Curso
Habilidades que obtendrás
- Algorithms
- Randomized Algorithm
- Sorting Algorithm
- Divide And Conquer Algorithms
Ofrecido por
Programa - Qué aprenderás en este curso
Week 1
Week 2
Week 3
Week 4
Reseñas
- 5 stars83,05 %
- 4 stars13,65 %
- 3 stars1,83 %
- 2 stars0,57 %
- 1 star0,87 %
Principales reseñas sobre 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.
Acerca de Programa especializado: Algoritmos

Preguntas Frecuentes
¿Cuándo podré acceder a las lecciones y tareas?
¿Qué recibiré si me suscribo a este Programa especializado?
¿Hay ayuda económica disponible?
¿Tienes más preguntas? Visita el Centro de Ayuda al Estudiante.