Analysis of Algorithms
This course teaches a calculus that enables precise quantitative predictions of large combinatorial structures.
Analysis of Algorithms
Recurrences
Generating Functions
Asymptotics
Analytic Combinatorics
Trees
Permutations
Strings and Tries
Words and Mappings
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.
Free
per course
Incentives
100% online
Flexible deadlines
Advanced Level
Approx. 19 hours to complete
English
Also check at
FAQs About "Analysis of Algorithms"
Is the online course "Analysis of Algorithms" free?
Is "Analysis of Algorithms" an online course worth taking?
About
Elektev is on a mission to organize educational content on the Internet and make it easily accessible. Elektev provides users with online course details, reviews and prices on courses aggregated from multiple online education providers.
DISCLOSURE: This page may contain affiliate links, meaning when you click the links and make a purchase, we receive a commission.
CONTACT
SOCIAL NETWORK
Copyright © Elektev