Top K 最小選擇算法 - O (n + k log n) vs O (n log k) for k << N [英]Top K smallest selection algorithm - O (n + k log n) vs O (n log k) for k << N