Github user davies commented on the pull request:
https://github.com/apache/spark/pull/2093#issuecomment-53381277
In PyPy 2.3, the result is reversed, MaxHeapQ is 3x faster than
nsmallest(). They are both implemented in pure Python, nsmallest() does more
than MaxHeapQ, it will make it stable.
If nsmallest() does not do stable sort, MaxHeapQ is still 30% faster than
nsmallest(), because it will try to call __le__ if no __lt__ (MaxHeapQ will
fail if object has no __gt__).
BTW, PyPy do very well in optimizing these algorithm.
---
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]
