Lecture 3 Probabilistic Analysis and Randomized

  • Published 2012


In this lecture we begin by introducing randomized (probabilistic) algorithms and the notion of worst-case expected time bounds. We make this concrete with a discussion of a randomized version of the Quicksort sorting algorithm, which we prove has worst-case expected running time O(n log n). In the process, we discuss basic probabilistic concepts such as events, random variables, and linearity of expectation.

Cite this paper

@inproceedings{2012Lecture3P, title={Lecture 3 Probabilistic Analysis and Randomized}, author={}, year={2012} }