Arge, Lars, et al. “A General Lower Bound on the I O-Complexity of Comparison-Based Algorithms”. DAIMI Report Series, vol. 21, no. 407, Aug. 1992, doi:10.7146/dpb.v21i407.6641.