link
来源：www.coursera.org
list
9个序列
assignment
等级：高级
label
算法和数据结构
chat_bubble_outline
语言：英语
card_giftcard
504分
评论
关键信息
credit_card
免费进入
verified_user
收费证书
timer
36小时总数
关于内容
This course teaches a calculus that enables precise quantitative predictions of large combinatorial structures. In addition, this course covers generating functions and real asymptotics and then introduces the symbolic method in the context of applications in the analysis of algorithms and basic structures such as permutations, trees, strings, words, and mappings. All the features of this course are available for free. It does not offer a certificate upon completion.
more_horiz
查看更多
more_horiz
收起
dns
课程大纲
Lecture 1 Analysis of Algorithms
Lecture 2 Recurrences
Lecture 3 Solving recurrences with GFs
Lecture 4 Asymptotics
Lecture 5 The symbolic method
Lecture 6 Trees
Lecture 7 Permutations
Lecture 8 Strings and Tries
Lecture 9 Words and Mappings
record_voice_over
教师
Robert Sedgewick
William O. Baker *39 Professor of Computer Science
Computer Science
store
内容设计师
Princeton University is a private research university located in Princeton, New Jersey, United States. It is one of the eight universities of the Ivy League, and one of the nine Colonial Colleges founded before the American Revolution.
assistant
平台
Coursera是一家数字公司，提供由位于加利福尼亚州山景城的计算机教师Andrew Ng和达芙妮科勒斯坦福大学创建的大型开放式在线课程。
Coursera与顶尖大学和组织合作，在线提供一些课程，并提供许多科目的课程，包括：物理，工程，人文，医学，生物学，社会科学，数学，商业，计算机科学，数字营销，数据科学 和其他科目。
您是 MOOC 的设计者？
keyboard_arrow_left
grade
keyboard_arrow_right
整合评论系统
