Timeline for What is the fastest way to sort numbers lexicographically?
Current License: CC BY-SA 3.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Nov 2, 2015 at 11:22 | vote | accept | Userbejian29 | ||
| Nov 2, 2015 at 10:43 | comment | added | user13113 | Relevant keyword: "trie". It's worth noting that this is not only good for sorting them, but for storing them as well, depending on the actual data and data structures. | |
| Nov 2, 2015 at 10:20 | comment | added | Brendan McKay | This is how radix sorts for mixed length strings. The time $O(KN)$ assumes you can sort a set of integers in linear time, which is true if only a constant number of integers can occur but isn't true in general. If the sets all have a single element but they can be arbitrary integers, you need $O(N\log N)$. | |
| Nov 2, 2015 at 10:11 | history | answered | Adam P. Goucher | CC BY-SA 3.0 |