What is the Big O of hashing when λ < 0.7 ?

  • A: O(1)
  • B: O(log n)
  • C: O(n)
  • D: O(n log n)
  • E: O(n2)

    Answer: A

    Although we expect some collisions (about 1 on average), this can be considered to be constant-time.

    Contents    Page-10    Prev    Next    Page+10    Index