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
204.930 ya inscrito
ofrecido por
Programa especializado: AlgoritmosUniversidad de StanfordAcerca de este Curso
116.285 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,62 %
- 3 stars1,82 %
- 2 stars0,54 %
- 1 star0,87 %
Principales reseñas sobre DIVIDE AND CONQUER, SORTING AND SEARCHING, AND RANDOMIZED ALGORITHMS
por NE6 de nov. de 2016
Personally, I would recommend this course to anyone who really wants to learn how things work in that sort of algorithms. I found the assignments a little difficult, but also extremely helpful.
por RK14 de jun. de 2021
A Great course for someone who is a beginner and is really dedicated towards learning Algorithms! I loved the instructor's explanations for the proof of correctness of algorithms.
por JJ28 de abr. de 2017
As someone with only (UK) high school level maths I just about managed to follow this. I am still confused by logarithms. I guess I should go and read the maths for computer science resource.
por RR28 de ene. de 2018
This was going to be a review of material for me, just a refresher. But instead I was exposed to a lot of new concepts and really feel like I got some good experience from it.
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.
