title: Worst Case Hash Function
body: <p>Something was mentioned in class along the lines of "the worst case hash function, h(x) = 1" </p>
  
  <p>(My instructor is out of town for a couple weeks; I obviously would just ask him if I could).</p>
  
  <p>My question: What exactly is meant by the "worst case hash function"? Is it such that each element is given the same value of 1 (or 1 % tableSize), or such that elementOne is given a hash value of 1, elementTwo 2, elementThree 3, and so on? </p>
  
  <p>Probably a noob question, but I thought I'd ask it anyhow.</p>