Today, we studied two algorithms. One is a randomized algorithm for selecting the k-th largest number. The other is a deterministic algorithm for selecting the median.
We proved that the first algorithm runs in linear time in expectation and the second algorithm runs in linear time.
Below are some nice notes from Avrim Blum for the materials covered in the course today.
No comments:
Post a Comment