Timeline for Stable radix sort in-place using O(1) space
Current License: CC BY-SA 3.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Mar 23, 2014 at 6:38 | vote | accept | bysreg | ||
| Mar 23, 2014 at 6:38 | comment | added | bysreg | Well, I guess for now, stable radix sort uses O(k+n) space. You would have to lose the stable property to achieve the O(1) space. | |
| Mar 23, 2014 at 6:13 | comment | added | 200_success | Wikipedia says radix sort uses O(k + n) space. I challenge you to do better than conventional wisdom. ☺ | |
| Mar 23, 2014 at 6:10 | comment | added | bysreg | thanks for the answer. can you also answer the second part of the question ? | |
| Mar 22, 2014 at 9:42 | history | answered | 200_success | CC BY-SA 3.0 |