Lecture 8: Order Statistics - Part 2 (Linear Time Deterministic Algorithm)

In this lecture we continue algorithms for computing order statistics, specifically, computing the ith smallest integer in a given array of integers. In this lecture we give an efficient linear time algorithm in worst case that computes the element of rank I in the given array. The instruction language is English, however, all slides, formulations, definitions, equations, etc., are all given in English.