Timeline for sorting / merging hashtable
Current License: CC BY-SA 3.0
11 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jan 19, 2015 at 11:23 | history | tweeted | twitter.com/#!/StackProgrammer/status/557136190739345408 | ||
| Jan 19, 2015 at 9:50 | comment | added | BlamKiwi | please ignore me, I overlooked the fact that the sub arrays are sorted. As Ixrec suggests MergeSort (K-Way even) or Polyphase is likely to be the best solution. | |
| Jan 19, 2015 at 5:59 | comment | added | Nick | elements are strings, but I am curious how radix can help | |
| Jan 19, 2015 at 5:46 | comment | added | BlamKiwi | What's the type of elements you are sorting over. Is a Radix Sort suitable? | |
| Jan 18, 2015 at 20:42 | comment | added | Nick | N is number of elements. Hashtable fits in memory. Buckets are fixed and because of this usually will be 1M or more. Count of the elements - unknown | |
| Jan 18, 2015 at 20:32 | answer | added | Doc Brown | timeline score: 1 | |
| Jan 18, 2015 at 20:24 | history | edited | Doc Brown | CC BY-SA 3.0 | wording improved |
| Jan 18, 2015 at 18:44 | answer | added | Ixrec | timeline score: 4 | |
| Jan 18, 2015 at 18:42 | answer | added | ratchet freak | timeline score: 1 | |
| Jan 18, 2015 at 18:36 | review | First posts | |||
| Jan 18, 2015 at 21:27 | |||||
| Jan 18, 2015 at 18:32 | history | asked | Nick | CC BY-SA 3.0 |