Back to search results

Analysis of Algorithms


Provider
coursera

Price
Free

School
Princeton University

Type
University

Instructor
Robert Sedgewick

Categories
Mathematics, Computer Science

Duration
6 weeks

Format
Video

Language
English

Description
Analysis of Algorithms aims to enable precise quantitative predictions of the properties of large combinatorial structures. The theory has emerged over recent decades as essential both for the scientific analysis of algorithms in computer science and for the study of scientific models in many other disciplines, including probability theory, statistical physics, computational biology and information theory. This course covers recurrence relations, generating functions, asymptotics, and fundamental structures such as trees, permutations, strings, tries, words, and mappings, in the context of applications to the analysis of algorithms.