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
201.536 ya inscrito
ofrecido por
Programa especializado: AlgoritmosUniversidad de StanfordAcerca de este Curso
119.931 vistas recientes
Fechas límite flexibles
Restablece las fechas límite en función de tus horarios.
Certificado para compartir
Obtén un certificado al finalizar
100 % en línea
Comienza de inmediato y aprende a tu propio ritmo.
Curso 1 de 4 en
Nivel intermedio
Aprox. 17 horas para completar
Inglés (English)
Subtítulos: Árabe (Arabic), Francés (French), Portugués (europeo), Italiano, Vietnamita, Alemán (German), Ruso (Russian), Inglés (English), Español (Spanish)
Habilidades que obtendrás
- Algorithms
- Randomized Algorithm
- Sorting Algorithm
- Divide And Conquer Algorithms
Fechas límite flexibles
Restablece las fechas límite en función de tus horarios.
Certificado para compartir
Obtén un certificado al finalizar
100 % en línea
Comienza de inmediato y aprende a tu propio ritmo.
Curso 1 de 4 en
Nivel intermedio
Aprox. 17 horas para completar
Inglés (English)
Subtítulos: Árabe (Arabic), Francés (French), Portugués (europeo), Italiano, Vietnamita, Alemán (German), Ruso (Russian), Inglés (English), Español (Spanish)
ofrecido por
Universidad de Stanford
The Leland Stanford Junior University, commonly referred to as Stanford University or Stanford, is an American private research university located in Stanford, California on an 8,180-acre (3,310 ha) campus near Palo Alto, California, United States.
Programa - Qué aprenderás en este curso
4 horas para completar
Week 1
Introduction; "big-oh" notation and asymptotic analysis.
4 horas para completar
13 videos (Total 130 minutos), 3 lecturas, 2 cuestionarios
4 horas para completar
Week 2
Divide-and-conquer basics; the master method for analyzing divide and conquer algorithms.
4 horas para completar
11 videos (Total 170 minutos), 2 lecturas, 2 cuestionarios
4 horas para completar
Week 3
The QuickSort algorithm and its analysis; probability review.
4 horas para completar
9 videos (Total 156 minutos), 1 lectura, 2 cuestionarios
5 horas para completar
Week 4
5 horas para completar
11 videos (Total 184 minutos), 3 lecturas, 3 cuestionarios
Reseñas
- 5 stars83,13 %
- 4 stars13,61 %
- 3 stars1,83 %
- 2 stars0,53 %
- 1 star0,87 %
Principales reseñas sobre DIVIDE AND CONQUER, SORTING AND SEARCHING, AND RANDOMIZED ALGORITHMS
por JR22 de jul. de 2020
This was a super interesting and well-taught course. I thoroughly enjoyed learning about and implementing the algorithms taught. I also enjoyed the abundance of extra material.
por VP26 de abr. de 2020
Professor Tim is an amazing instructor, and he explained all those elegant proofs in a brief and concise manner. I really enjoyed this course and certainly felt my IQ level going above roof ! :P
por MK14 de sep. de 2019
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 :-)
por AC3 de ene. de 2020
A bit too heavy on the probability and mathematical proof side, otherwise I learned a lot about divide and conquer algorithms and minimum cut as well as the Master Method for algorithm analysis.
Acerca de Programa especializado: Algoritmos
Algorithms are the heart of computer science, and the subject has countless practical applications as well as intellectual depth. This specialization is an introduction to algorithms for learners with at least a little programming experience. The specialization is rigorous but emphasizes the big picture and conceptual understanding over low-level implementation and mathematical details. After completing this specialization, you will be well-positioned to ace your technical interviews and speak fluently about algorithms with other programmers and computer scientists.
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 Alumno.
