Yr2 Hash Tables
暂无描述。系统推荐的高质量记忆内容，适合每天坚持背诵学习。
卡片预览 (8 张)
What is a hash table?
Where data is stored is determined by hashing said data to produce the number corresponding to a memory location based
What is the theoretical speed of a hash table search?
O(1)
What is a big issue with hash tables?
Collisions - collisions are where two pieces of data produce the same memory location when hashed
What are the two solutions to hash table collisions?
• Overflow (best solution) • Storing in the next memory location
How can overflow be used to solve a hash table collision?
Using a linked list store both pieces of data in the same memory location and refer to them using pointers when needed.
What issues are there with using overflow to solve a hash table collision?
The memory location may be unable to store both pieces of data if they are too large
What problems are there with storing data int he next memory location in order to solve hash table collisions?
It increases the chance of collisions in the future
What is a dictionary?
A data structure that maps items to other specified values