Trey Hunner 🐍 on Nostr: n >= k (where n is the size of the iterable and k is the number of items you want) so ...

n >= k (where n is the size of the iterable and k is the number of items you want) so n log n >= n log k, meaning sorting will be slower (especially if k is much smaller than n).