Browse•Categories•Random

Hash table

Duration: 7 minutes, 15 seconds
Related Topics:
  • Hash tables are used to implement associative arrays.
  • A hash table that uses chaining makes use of linked lists.
  • Rehashing a hash table takes Θ(n) time.
  • Insertion and deletion in a dynamically sized hash table have a constant amortized cost, assuming the hash function has sufficiently random behavior.
Category:
Data structures
References:
Tags: hash table, hashtable, hash function, resolving collisions, collision resolution, chaining, separate chaining, direct chaining, open addressing, linear probing, quadratic probing, load factor, associative array, dictionary, map, data structure, computer science animations, computer programming, Flash, learn computer science, study computer science

Home•About•Links

© 2008 - 2024 Bill Jacobs