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).
ofrecido por
Programa especializado: AlgoritmosUniversidad de StanfordAcerca de este Curso
139.604 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
AlgorithmsRandomized AlgorithmSorting AlgorithmDivide 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
Principales reseñas sobre DIVIDE AND CONQUER, SORTING AND SEARCHING, AND RANDOMIZED ALGORITHMS
por KS13 de sep. de 2018
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.
por DT26 de may. de 2020
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
por CV10 de jun. de 2017
A really exciting and challenging course. Loved the way the instructor explained everything with so much detail and precision. Definitely looking forward to the next course in the specialization.
por FR15 de mar. de 2017
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
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.
