Divide and Conquer, Sorting and Searching, and Randomized Algorithms

Por: Coursera . en: , ,

Descripción del Curso

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).

Plataforma

Valoraciones

Divide and Conquer, Sorting and Searching, and Randomized Algorithms

Media de valoraciones

0

0 valoraciones

5 1

Detalle

5 Estrellas
0
4 Estrellas
0
3 Estrellas
0
2 Estrellas
0
1 Estrella
0

Añadir una Valoración

Nombre
Email
Titulo
Valoración
Contenido