Affects Version/s: None
Fix Version/s: 0.18.0
The current implementation of QuickSort naively partitions on either side of the pivot. We can improve this by partitioning on either side of the set of values equal to the pivot. This assumes that comparing keys is expensive compared to swaps and index comparisons (which it certainly is in MapTask, and should be in general).
|Status||Open [ 1 ]||Patch Available [ 10002 ]|
|Assignee||Chris Douglas [ chris.douglas ]|
|Resolution||Fixed [ 1 ]|
|Status||Patch Available [ 10002 ]||Resolved [ 5 ]|
|Status||Resolved [ 5 ]||Closed [ 6 ]|