Time complexity isn’t even associated to the size of the list. Amazing!

  • I didn’t mean to imply that it was; I was referring to countless developers I’ve worked with over the years who thought hash maps were the fastest memory storage structure because they are generally O(1); they’ve mostly been ignorant of the fact that it’s only true for sufficiently small values of “1”.