Basics

video-placeholder
Loading...
View Syllabus

Reviews

4.5 (139 ratings)

  • 5 stars
    76.25%
  • 4 stars
    11.51%
  • 3 stars
    5.75%
  • 2 stars
    2.15%
  • 1 star
    4.31%

AV

Aug 24, 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

Apr 7, 2020

Filled StarFilled StarFilled StarFilled StarFilled Star

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

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

  • Placeholder

    Robert Sedgewick

    William O. Baker *39 Professor of Computer Science

Explore our Catalog

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