My Favorite Algorithm: Linear Time Median Finding (2018)

The linked article is about an efficient algorithm for finding the median of a set of numbers in linear time. It discusses the Blum-Floyd-Pratt-Rivest-Tarjan (BFPRT) algorithm, which is a randomized algorithm that can find the median of a set of n numbers in O(n) time. The article explains the key steps of the algorithm and provides a detailed analysis of its time complexity, showing how it outperforms the traditional sorting-based approach for finding the median.