I doubt he is right for any N. Association lists require on average N+1 memory accesses. Small hash tables require 1 memory access.

Only in edge cases like looking up a long string in an alist consisting of one short string he's right.