Re:Parallel In-Place Merge Sort
by wfunction on Friday October 03, 2014 @12:55AM
(#8404370)
Ohh sorry, I thought you were talking about the merge, not the sort. Yes O(n log n) is allowed for the merge, but what I'm saying is that the Dr. Dobbs article's in-place merge sort is actually not quite an in-place variant of merge sort: its complexity (as far as I can tell) is O(n log^2 n) rather than O(n log n).
[ Parent
| on HN ]
There are no comments on this comment yet.