Talk:Sorting algorithms/Radix sort: Difference between revisions
Content added Content deleted
m (→Negatives: changed ''numbers'' --> ''integers''. -- ~~~~) |
No edit summary |
||
Line 6: | Line 6: | ||
::: Yuppers, the negative integers were a small annoyance, all right (concerning the REXX example). -- [[User:Gerard Schildberger|Gerard Schildberger]] 22:03, 11 June 2012 (UTC) |
::: Yuppers, the negative integers were a small annoyance, all right (concerning the REXX example). -- [[User:Gerard Schildberger|Gerard Schildberger]] 22:03, 11 June 2012 (UTC) |
||
==C code== |
|||
in the C code for radix sort, it seems to me that the condition ll < to after the "while (1)" loop is always fulfilled, and can thus be removed. Indeed in the "while (1)" loop we always have ll <= rr, thus since rr decreases ll cannot exceed the initial value of rr, which is to - 1. |
|||
[[User:Paul Zimmermann]] 13:09, 30 October 2012 |