Basics

Loading...
查看授课大纲

审阅

4.6(105 个评分)
  • 5 stars
    78.09%
  • 4 stars
    9.52%
  • 3 stars
    6.66%
  • 2 stars
    2.85%
  • 1 star
    2.85%
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.

从本节课中
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.

教学方

  • Placeholder

    Robert Sedgewick

    William O. Baker *39 Professor of Computer Science

探索我们的目录

免费加入并获得个性化推荐、更新和优惠。