Next Hash Hash Hash 26


  • Every string is stored in a single giant hash table

    • Variable names too

  • Associative structures ("tables") are handled differently

        T = TABLE()
        T<'HAMILTON'> = 'MARGARET'
        WORD = 'HAM' 'IL' 'TON'
        OUTPUT = T<WORD>

  • The key is located by a linear search of the left-hand column

  • But each step is a single pointer comparison

Next 26