This course covers basics of algorithm design and analysis, as well as algorithms for sorting arrays, data structures such as priority queues, hash functions, and applications such as Bloom filters.
Este curso forma parte de Programa especializado: Data Science Foundations: Data Structures and Algorithms

Acerca de este Curso
Calculus: derivatives and integrals. Probability theory: distributions, expectations, and moments. Some programming experience with Python.
Qué aprenderás
Explain fundamental concepts for algorithmic searching and sorting
Describe heap data structures and analyze heap components, such as arrays and priority queues
Design basic algorithms to implement sorting, selection, and hash functions in heap data structures
Habilidades que obtendrás
- Analysis of Algorithms
- Hashtables
- Algorithm Design
- Python Programming
- Data Structure Design
Calculus: derivatives and integrals. Probability theory: distributions, expectations, and moments. Some programming experience with Python.
Ofrecido por
Comienza a trabajar para obtener tu maestría
Programa - Qué aprenderás en este curso
Basics of Algorithms Through Searching and Sorting
Heaps and Hashtable Data Structures
Randomization: Quicksort, Quickselect, and Hashtables
Applications of Hashtables
Reseñas
- 5 stars82,56 %
- 4 stars11 %
- 3 stars2,29 %
- 2 stars1,83 %
- 1 star2,29 %
Principales reseñas sobre ALGORITHMS FOR SEARCHING, SORTING, AND INDEXING
Good course with challenging assignments. Makes you think a lot.
Very engaging and clear lessons and quizzes. There're only some typos but they don't hinder the learning process
The lectures are delivered with just the right amount of math, intuition and examples.
Some programming assignments were easy. Apart from that this course is excellent
Acerca de Programa especializado: Data Science Foundations: Data Structures and Algorithms

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.