Randomized Algorithms: 1.6 Median Finding Algorithm - Select(S,k) routine in more detail.

Randomized algorithms contain an element of randomization in at least one of its steps and this randomization along with divide and conquer approach goes a long way in reducing the computation time of the algorithm. In this series on randomization, the problem of median finding is discussed in different sessions. For the benefit of the viewers, complete analysis of the algorithm is also presented. Some students are confused about the Select(S,K) routine; this video describes the function in more detail so that all doubts are removed.