Github user davies commented on the pull request:
https://github.com/apache/spark/pull/2093#issuecomment-53377764
Only for N (top) > S (total), nsmallest() will sort, it's faster than heap,
because it's implemented in C.
For N << S, they should be the similar (same algorithm).
nsmallest() is stable, for the same key, the values will keep in the order
as them in the original RDD.
nsmallest(n, it, key=None)/nlargest(n, it, key=None) are available since
Python 2.5.
---
If your project is set up for it, you can reply to this email and have your
reply appear on GitHub as well. If your project does not have this feature
enabled and wishes so, or if the feature is enabled but not working, please
contact infrastructure at [email protected] or file a JIRA ticket
with INFRA.
---
---------------------------------------------------------------------
To unsubscribe, e-mail: [email protected]
For additional commands, e-mail: [email protected]
