All episodes of Algorithm Design and Analysis

Episodes

A more complex recurrence relation and counting inversions

In Lecture 4, students learn about solving a more complex recurrence relation by unwrapping. Gusfield also addresses the problem of counting inversions in a permutation.

Published 10/01/10

Time analysis of Mergesort

In Lecture 3, Gusfield gives the worst-case analysis of MergeSort by setting up a recurrence relation and solving it by unwrapping.

Published 09/29/10

Big-Oh, Omega and Theta notation

In Lecture 2, Gusfield discusses Big-Oh, Omega and Theta notation. He describes Mergesort and Merge and the start of their time analysis.

Published 09/27/10

Introduction to the course and algorithm complexity

This is the course introduction about algorithm complexity, including what "worst case running time" means and how it is measured.

Published 09/24/10

Introduction to the videos

This video shows the URL for printed material that accompanies the course, and a URL for more advanced lectures on material that overlaps and extends the course. The URL for printed course material is: www.cs.ucdavis.edu/~gusfield/itunesU The URL for more advanced lectures is: www.cs.ucdavis.edu/~gusfield/cs222f07/videolist.html

Published 09/23/10