I am struggling to understand how much space will be used by a hash table versus a vector, consisting of all permutations of six base-36 numbers, in Common Lisp, where base-36 is native.
Could you please guide me step by step in understanding this, from a complete beginner PoV, both in math and Common Lisp?
In Common Lisp:
-
How much space does it take to store one base-36 numeral, like “Z”?
-
How much overhead does a hash-table require to store the combinations of six such base36 numbers, ie “ZZZZZZ”, as keys, being the value of each key either “T” or “NIL”?
-
How much overhead would a vector use instead?