Basics

video-placeholder
Loading...
View Syllabus

Reviews

4.5 (130 ratings)
  • 5 stars
    76.15%
  • 4 stars
    10.76%
  • 3 stars
    6.15%
  • 2 stars
    2.30%
  • 1 star
    4.61%
FM
Apr 16, 2020

clear explanation, and amazing tools to analyze algorithms through a scientific approach.

ON
Apr 7, 2020

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.