Anonymous user
Talk:Sorting algorithms/Radix sort: Difference between revisions
→Negatives: added yet another comment to the affirmative. -- ~~~~
(→Negatives: I went with the route of least resistance) |
(→Negatives: added yet another comment to the affirmative. -- ~~~~) |
||
Line 4:
:: The easiest way to handle negative numbers might be to find the minimum value in the list, subtract it from every item in the unsorted list and add it to every item in the sorted list. This approach is modular and can wrap any "non-negative integers only" implementation, and work well in a variety of circumstances. That said the "double the bins" approach might have an efficiency advantage when the the absolute value of the maximum equals the absolute value of the minimum. --[[User:Rdm|Rdm]] 16:13, 19 January 2011 (UTC)
::: It was a smaller change to the code I already had working for the positive case. :-) –[[User:Dkf|Donal Fellows]] 16:42, 19 January 2011 (UTC)
::: Yuppers, the negatives numbers were a small anoyance, all right (concerning the REXX example). -- [[User:Gerard Schildberger|Gerard Schildberger]] 22:03, 11 June 2012 (UTC)
| |||