Basics

video-placeholder
Loading...
Ver programa

Reseñas

4.5 (138 calificaciones)

  • 5 stars
    76,08 %
  • 4 stars
    11,59 %
  • 3 stars
    5,79 %
  • 2 stars
    2,17 %
  • 1 star
    4,34 %

AV

24 de ago. de 2020

Filled StarFilled StarFilled StarFilled StarFilled Star

I enjoyed problems given in the quizzes. The course is one of the best presentations I have seen.

ON

7 de abr. de 2020

Filled StarFilled StarFilled StarFilled StarFilled Star

Wonderful insights about the study of the algorithm's complexity and combinatoric logic.

De la lección

Permutations

The study of sorting algorithms is the study of properties of permutations. We introduce analytic-combinatoric approaches to studying permutations in the context of this relationship.

Impartido por:

  • Placeholder

    Robert Sedgewick

    William O. Baker *39 Professor of Computer Science

Explora nuestro catálogo

Inscríbete de manera gratuita y obtén recomendaciones personalizadas, actualizaciones y ofertas.