Details
Description
For large datasets with many partitions (N), sortByKey() will be very slow, because it will take O(N) time in rangePartitioner.
This could be improved by using binary search, the time will be reduced to O(logN).
Attachments
Issue Links
- links to