Divide and Conquer, Sorting and Searching, and Randomized Algorithms
https://www.coursera.org/learn/algorithms-divide-conquer
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).
Categoria: Computer Science
Subcategoria: Algorithms
Tipo de Curso: Course
Habilidades: Algorithms,Randomized Algorithm,Sorting Algorithm,Divide And Conquer Algorithms,
Idioma: English
Subtitulos: Arabic, French, Portuguese (European), Italian, Vietnamese, German, Russian, English, Spanish
Rating: 4.8stars
Vistas: 5.050
Sitio Web: Coursera
Duracion: Approx. 16 hours to complete
Volver a
lista de cursos