Life, part 22

added by DotNetKicks
7/10/2020 2:23:13 PM

491 Views

Code for this episode is here. So far in this series every algorithm we've attempted has been either O(cells) or O(changes) in time, and O(cells) in space. Going with a straightforward "big square with dead cells surrounding it" approach tends to use up a lot of space as the side of the square grows larger....


0 comments