Sets of Cycles

Loading...
Princeton University
4.7 (51 ratings) | 21K Students Enrolled
View Syllabus

Reviews

4.7 (51 ratings)
  • 5 stars
    44 ratings
  • 4 stars
    3 ratings
  • 3 stars
    3 ratings
  • 1 star
    1 ratings
AK

Apr 29, 2018

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

HL

Mar 10, 2018

This is great course if you already done some algorithms courses and want to go deeper.

From the lesson
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.

Taught By

  • Robert Sedgewick

    Robert Sedgewick

    William O. Baker *39 Professor of Computer Science

Explore our Catalog

Join for free and get personalized recommendations, updates and offers.