Update of bug #37130 (project gnustep):
Status: None => Confirmed
_______________________________________________________
Follow-up Comment #5:
Hmm, not sure, I think using two arrays, merging from one into the other and
swapping them in each recursion step should give the same performance as
creating a new array for each step. The only additional work is to copy the
objects over to the additional array at the start.
In the mean time I have also read up on merge sort and the best way to do it
seems to use the pre-existing runs. But that would require a bit more coding.
Back tot he original question, what to do with the code? Adam, Greg, Richard?
Any position on whether we may merge this code?
_______________________________________________________
Reply to this item at:
<http://savannah.gnu.org/bugs/?37130>
_______________________________________________
Nachricht gesendet von/durch Savannah
http://savannah.gnu.org/
_______________________________________________
Bug-gnustep mailing list
[email protected]
https://lists.gnu.org/mailman/listinfo/bug-gnustep
