课程信息
4.8
46 个评分
6 个审阅

100% 在线

立即开始,按照自己的计划学习。

可灵活调整截止日期

根据您的日程表重置截止日期。

高级

完成时间大约为26 小时

英语(English)

字幕:英语(English)

100% 在线

立即开始,按照自己的计划学习。

可灵活调整截止日期

根据您的日程表重置截止日期。

高级

完成时间大约为26 小时

英语(English)

字幕:英语(English)

教学大纲 - 您将从这门课程中学到什么

1
完成时间为 2 小时

Analysis of Algorithms

We begin by considering historical context and motivation for the scientific study of algorithm performance. Then we consider a classic example that illustrates the key ingredients of the process: the analysis of Quicksort. The lecture concludes with a discussion of some resources that you might find useful during this course....
4 个视频 (总计 76 分钟), 2 个阅读材料, 1 个测验
4 个视频
A Scientific Approach 16分钟
Example: Quicksort 30分钟
Resources 17分钟
2 个阅读材料
Getting Started10分钟
Exercises from Lecture 110分钟
1 个练习
Analysis of Algorithms4分钟
2
完成时间为 2 小时

Recurrences

We begin this lecture with an overview of recurrence relations, which provides us with a direct mathematical model for the analysis of algorithms. We finish by examining the fascinating oscillatory behavior of the divide-and-conquer recurrence corresponding to the mergesort algorithm and the general "master theorem" for related recurrences....
5 个视频 (总计 71 分钟), 1 个阅读材料, 3 个测验
5 个视频
Telescoping15分钟
Types of Recurrences 12分钟
Mergesort 18分钟
Master Theorem 14分钟
1 个阅读材料
Exercises from Lecture 210分钟
3 个练习
Pop Quiz on Telescoping2分钟
Pop Quiz on the Master Theorem2分钟
Recurrences4分钟
3
完成时间为 2 小时

Generating Functions

Since the 17th century, scientists have been using generating functions to solve recurrences, so we continue with an overview of generating functions, emphasizing their utility in solving problems like counting the number of binary trees with N nodes....
5 个视频 (总计 84 分钟), 1 个阅读材料, 1 个测验
5 个视频
Counting with Generating Functions27分钟
Catalan Numbers14分钟
Solving Recurrences18分钟
Exponential Generating Functions7分钟
1 个阅读材料
Exercises from Lecture 310分钟
1 个练习
Generating Functions6分钟
4
完成时间为 2 小时

Asymptotics

Exact answers are often cumbersome, so we next consider a scientific approach to developing approximate answers that, again, mathematicians and scientists have used for centuries....
4 个视频 (总计 83 分钟), 1 个阅读材料, 1 个测验
4 个视频
Manipulating Expansions 19分钟
Asymptotics of Finite Sums 16分钟
Bivariate Asymptotics 28分钟
1 个阅读材料
Exercises from Lecture 410分钟
1 个练习
Asymptotics4分钟
4.8
6 个审阅Chevron Right

热门审阅

创建者 AKApr 29th 2018

This course is more about mathematic than algorithms, it teaches how to solve tricky combinatorial problems

创建者 HLMar 10th 2018

This is great course if you already done some algorithms courses and want to go deeper.

讲师

Avatar

Robert Sedgewick

William O. Baker *39 Professor of Computer Science
Computer Science

关于 普林斯顿大学

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....

常见问题

  • 注册以便获得证书后,您将有权访问所有视频、测验和编程作业(如果适用)。只有在您的班次开课之后,才可以提交和审阅同学互评作业。如果您选择在不购买的情况下浏览课程,可能无法访问某些作业。

  • No. As per Princeton University policy, no certificates, credentials, or reports are awarded in connection with this course.

还有其他问题吗?请访问 学生帮助中心