Basics

video-placeholder
Loading...
Ver programa

Reseñas

4.5 (163 calificaciones)

  • 5 stars
    76,07 %
  • 4 stars
    12,26 %
  • 3 stars
    5,52 %
  • 2 stars
    2,45 %
  • 1 star
    3,68 %

AK

28 de abr. de 2018

This course is more about mathematic than algorithms, it teaches how to solve tricky combinatorial problems

AV

24 de ago. de 2020

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

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.