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
Challenging and eye opening to algorithm design paradigms. As a code writer for data analysis in a scientific field, this course really motivated me to delve deeper in this rich field.
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 :-)
Very good course in algorithms. I bought the book to help me understand but the lectures make it way easier and thus much more fun to understand the analysis. Looking forward to complete the spec
It would be great if lectures and slides would be with better design and to make and record new slides and lectures. Because these lectures seems too old. Everything else is great.
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.