On Mar 5, 3:28 am, Mark Engelberg wrote:
> 3. What would you predict to be the most efficient way to implement a
> (non-destructive) double-dimensioned array?:
> a) A vector of vectors.
> b) A hash map that correlates [i j] pairs with values.
> c) A flat vector, and write lookup and a
1. What is the most elegant way to create/initialize a nested vector,
such as to represent a double-dimensioned array?
2. There's get-in for nested structures and get for flat. There's
update-in for nested structures, why not plain update for flat?
3. What would you predict to be the most effici
