BGFs and Distributions

From the course by Princeton University
Analysis of Algorithms
16 ratings
Princeton University
16 ratings
From the lesson
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.

Meet the Instructors

  • Robert Sedgewick
    Robert Sedgewick
    William O. Baker *39 Professor of Computer Science
    Computer Science