Timeline for What is the most efficient algorithm for creating a list of unique values from a list of pairs of value?
Current License: CC BY-SA 4.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jan 7, 2021 at 18:29 | vote | accept | Herman Autore | ||
| Jan 5, 2021 at 23:51 | answer | added | Ethan | timeline score: 1 | |
| Sep 13, 2018 at 21:13 | history | edited | Herman Autore | CC BY-SA 4.0 |
added 323 characters in body
|
| Sep 12, 2018 at 9:57 | comment | added | Mike Borkland | Yes, that's correct. | |
| Sep 12, 2018 at 4:46 | comment | added | Herman Autore | So in Python a list object is a dynamic array, while a dictionary is a hash table? Do Python sets also work as hash tables? | |
| Sep 11, 2018 at 23:48 | comment | added | Mike Borkland |
Use a hash table instead of a dynamic array to store the names. Look into Python's set.
|
|
| Sep 11, 2018 at 23:35 | history | edited | Herman Autore | CC BY-SA 4.0 |
Better formatting
|
| Sep 11, 2018 at 23:30 | history | asked | Herman Autore | CC BY-SA 4.0 |