To support our site, Class Central may be compensated by some course providers.

Analysis of Algorithms

Princeton University via Coursera

students interested
  • Provider Coursera
  • Subject Algorithms and Data Structures
  • $ Cost Free Online Course (Audit)
  • Session Upcoming
  • Language English
  • Effort 6-8 hours a week
  • Start Date
  • Duration 9 weeks long

Taken this course? Share your experience with other students. Write review


Sign up to Coursera courses for free Learn how

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.


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.

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.

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.

Analytic Combinatorics
Analytic Combinatorics. With a basic knowledge of recurrences, generating functions, and asymptotics, you are ready to learn and appreciate the basic features of analytic combinatorics, a systematic approach that avoids much of the detail of the classical methods that we have been considering. We introduce unlabeled and labelled combinatorial classes and motivate our basic approach to studying them, with numerous examples.

The quintessential recursive structure, trees of various sorts are ubiquitous in scientific enquiry, and they arise explicitly in countless computing applications. You can find broad coverage in the textbook, but the lecture focuses on the use of analytic combinatorics to enumerate various types of trees and study parameters.

The study of sorting algorithms is the study of properties of permutations. We introduce analytic-combinatoric approaches to studying permutations in the context of this relationship.

Strings and Tries
From DNA sequences to web indices, strings (sequences of characters) are ubiquitous in modern computing applications, so we use analytic combinatorics to study their basic properties and then introduce the trie, an essential and fundamental structure not found in classical combinatorics.

Words and Mappings
We view strings as sets of characters or as functions from [1..N] to [1..M] to study classical occupancy problems and their application to fundamental hashing algorithms. Functions from [1..N] to [1..N] are mappings, which have an interesting and intricate structure that we can study with analytic combinatorics.

Taught by

Robert Sedgewick

Help Center

Most commonly asked questions about Coursera Coursera

Reviews for Coursera's Analysis of Algorithms
4.8 Based on 4 reviews

  • 5 stars 75%
  • 4 star 25%
  • 3 star 0%
  • 2 star 0%
  • 1 star 0%

Did you take this course? Share your experience with other students.

Write a review
  • 1
Mauro L
4.0 3 years ago
by Mauro partially completed this course, spending 7 hours a week on it and found the course difficulty to be very hard.
Difficult, and mathematically demanding.

Self-paced and ungraded, due to both, the inherent difficulty of the subject, and the difficulty of grading the exercises.
4 people found
this review helpful
Was this review helpful to you? Yes
Maresu R
5.0 3 years ago
Maresu partially completed this course.
Was this review helpful to you? Yes
Christopher P
5.0 2 years ago
by Christopher partially completed this course.
Was this review helpful to you? Yes
Juliano I
5.0 2 years ago
by Juliano audited this course.
Was this review helpful to you? Yes
  • 1

Class Central

Get personalized course recommendations, track subjects and courses with reminders, and more.

Sign up for free

Never stop learning Never Stop Learning!

Get personalized course recommendations, track subjects and courses with reminders, and more.