Divide and Conquer, Sorting and Searching, and Randomized Algorithms (Coursera)
Descripción de “Divide and Conquer, Sorting and Searching, and Randomized Algorithms (Coursera)”
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).
Who is this class for: Learners with at least a little bit of programming experience who want to learn the essentials of algorithms. In a University computer science curriculum, this course is typically taken in the third year.
Course 1 of 4 in the Algorithms Specialization.
Especificaciones: Divide and Conquer, Sorting and Searching, and Randomized Algorithms (Coursera)
| Curso ofrecido por | ||||||||||
|---|---|---|---|---|---|---|---|---|---|---|
|
||||||||||
| Nivel, duración y fechas | ||||||||||
|
||||||||||
| Idioma del curso | ||||||||||
|
||||||||||
| Exámenes y Certificados | ||||||||||
|
||||||||||
User Reviews
Se el primero en opinar sobre “Divide and Conquer, Sorting and Searching, and Randomized Algorithms (Coursera)”
Divide and Conquer, Sorting and Searching, and Randomized Algorithms (Coursera)
Aún no hay reseñas.