“…Similarly, if k < m, then the algorithm recursively operates on the set of keys larger than the pivot and returns the (k − m)-th smallest key from the subset. Although previous studies (e.g., Knuth [11], Mahmoud et al [15], Prodinger [18], Grübel and U. Rösler [7], Lent and Mahmoud [14], Mahmoud and Smythe [16], Devroye [1], Hwang and Tsai [9]) examined Quickselect with regard to key comparisons, this study is the first to analyze the bit complexity of the algorithm.…”