Analysis of Algorithms

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.

Add your review

Analysis of Algorithms – A free online course from Princeton University.

Course description – Analysis of Algorithms

This free online 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.

Course content

  • Analysis of Algorithms
  • Recurrences
  • Generating Functions
  • Asymptotics
  • Analytic Combinatorics
  • Trees
  • Permutations
  • Strings and Tries
  • Words and Mappings

Subscribe to Get the Best Learning Opportunities

User Reviews

0.0 out of 5
0
0
0
0
0
Write a review

There are no reviews yet.

Be the first to review “Analysis of Algorithms”

Your email address will not be published. Required fields are marked *

Analysis of Algorithms
Analysis of Algorithms
Nasroo