Timeline for Algorithm to determine direction based on previous tiles
Current License: CC BY-SA 3.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jan 2, 2018 at 7:58 | comment | added | doubleYou | Less overhead in space or runtime? Honestly, don't even worry about it! Both algorithms are in O(1) space and O(1) time and unless you're dealing with billions and billions of them, performance will not be an issue. | |
| Jan 2, 2018 at 1:02 | comment | added | iPhoenix | That’s a very clever method, Thanks! I’d imagine the hash table (Approach B) would require less overhead, but that’s different between languages and the number of times tiles need to be generated, I’d imagine. | |
| Jan 2, 2018 at 0:59 | vote | accept | iPhoenix | ||
| Jan 2, 2018 at 0:32 | history | edited | doubleYou | CC BY-SA 3.0 | added 245 characters in body |
| Jan 2, 2018 at 0:19 | history | answered | doubleYou | CC BY-SA 3.0 |