0

Which mechanism does it use form the following? https://en.wikipedia.org/wiki/Hash_table#Collision_resolution

Novellizator
  • 13,633
  • 9
  • 43
  • 65

1 Answers1

2

Open addressing with quadratic probing (reference: source code).

Note 1: Not everything that acts like an associative array is actually implemented as a hash table under the hood. In particular, small/dense arrays like [3, 1, 4, 1.5] are backed by an actual array (similar to a C array) for fast index-based access.

Note 2: The answer to this question may or may not change over time if/when the team experiments with alternative implementations. For example, open addressing requires relatively low load factors in order to provide quick accesses; it would be interesting to find an implementation that's more memory efficient (without being slower).

jmrk
  • 34,271
  • 7
  • 59
  • 74