ECS 122A: Algorithm Design and Analysis
ECS 122A: Algorithm Design and Analysis (Fall 2010, UC Davis). Taught by Professor Dan Gusfield, this course introduces fundamental techniques and viewpoints for the design and the analysis of efficient computer algorithms, and studies important specific algorithms. The course relies heavily on mathematics and mathematical thinking in two ways: first as a way of proving properties about particular algorithms such as termination, and correctness; and second, as a way of establishing bounds on the worst case (or average case) use of some resource, usually time, by a specific algorithm. The course covers some randomized algorithms as well as deterministic algorithms.
| Lecture 08 - Expected Number of Comparisons in Randomized Select |
Go to the Course Home or watch other lectures: