JamesFlare/CSCI-1200
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

line break

Browse Source
This commit is contained in:
Jidong Xiao
2023-11-05 21:54:19 -05:00
parent 99b96a92ba
commit d1a35cb4b3
1 changed files with 3 additions and 1 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
lectures/20_hash_tables_I/README.md
View File

@@ -5,9 +5,11 @@
- Hash Tables, Hash Functions, and Collision Resolution <!--(leetcode 1, 705, 706)--> - Hash Tables, Hash Functions, and Collision Resolution <!--(leetcode 1, 705, 706)-->
- Performance of: Hash Tables vs. Binary Search Trees - Performance of: Hash Tables vs. Binary Search Trees
- Collision resolution: separate chaining vs open addressing - Collision resolution: separate chaining vs open addressing
- STL’s unordered_set (and unordered_map) - STL’s unordered_set and unordered_map
- Using a hash table to implement a set/map - Using a hash table to implement a set/map
– Hash functions as functors/function objects (leetcode 1451: Rearrange Words in a Sentence) – Hash functions as functors/function objects (leetcode 1451: Rearrange Words in a Sentence)
– Iterators, find, insert, and erase – Iterators, find, insert, and erase
## 20.1 Definition: What’s a Hash Table? ## 20.1 Definition: What’s a Hash Table?