Learning objectives
After this class, you should be able to:
- Derive the time complexity of the better randomized selection algorithm discussed in class.
Reading assignment
- Class notes and section 4 of http://www.csee.wvu.edu/~ksmani/courses/fa01/random/lecnotes/lecture4.pdf.
Exercises and review questions
- Questions on current lecture's material
- Prove that the expected time complexity of randomized selection is
2n + o(n).- Questions on next lecture's material
- None.