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.
Offert par
Analyse de la complexité des algorithmes
Université de PrincetonÀ propos de ce cours
Offert par

Université de Princeton
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.
Programme de cours : ce que vous apprendrez dans ce cours
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.
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.
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.
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.
Avis
- 5 stars76,31 %
- 4 stars11,18 %
- 3 stars5,92 %
- 2 stars2,63 %
- 1 star3,94 %
Meilleurs avis pour ANALYSE DE LA COMPLEXITÉ DES ALGORITHMES
Wonderful insights about the study of the algorithm's complexity and combinatoric logic.
This course is more about mathematic than algorithms, it teaches how to solve tricky combinatorial problems
Excellent course with very interesting and well explained topics, for those with certain background in mathematics (and, specially, in analysis and combinatorics).
Excellent course, great exercise in combinatorics.
Foire Aux Questions
Quand aurai-je accès aux vidéos de cours et aux devoirs ?
Can I earn a certificate in this course?
D'autres questions ? Visitez le Centre d'Aide pour les Étudiants.