Week 10 Day 3 - Sets vs. Maps vs. Unordered Maps

Channel:
United States Bill Kerney
Subscribers:
2,640
Published on ● Video Link: https://www.youtube.com/watch?v=epmAyj3iIGI


Duration: 1:29:08
137 views
0

Today we covered the difference between these classes in the standard library:
1) Set - a balanced BST that uses the comparison operator to sort the nodes in the tree
2) Map - a balanced BST that uses a separate key to sort and search the nodes in the tree. It can also be used like an "associative array" in which you can use non-integers for accessing an array, like calendar["March"] = 31;
3) Unordered_maps - a map that is implemented using a hash table, that has even faster performance than a BST at inserting, searching, and deleting, but does not keep the data in sorted order.



Other Videos By Bill Kerney


2021-03-26Week 10 Day 2 - Social Impact of Computer Science
2021-03-26Week 11 Day 2 - Lighting Part II and a Simple Inventory System
2021-03-26Week 11 Day 2 - Syscalls, Interrupts and Memory Management
2021-03-24Week 10 Day 2 - Racism and Computer Science
2021-03-24Week 11 Day 2 - Big O, Heaps, Hash Tables
2021-03-24Week 11 Day 1 - How Color Works
2021-03-24Week 11 Day 1 - From Low Level Syscalls to High Level Modern C++
2021-03-23Week 10 Day 1 - Social Impact of Computer Science
2021-03-22Week 10 - Triangularization and Rasterization
2021-03-22Week 11 Day 1 - Move Constructors
2021-03-20Week 10 Day 3 - Sets vs. Maps vs. Unordered Maps
2021-03-19Week 9 Day 3 - Algorithmic Bias
2021-03-19Week 10 Day 2 - HUDs
2021-03-18Week 10 Day 2 - NEON Part III, CALL
2021-03-18Week 9 Day 2 - Algorithms II
2021-03-17Week 10 Day 2 - BSTs Part 3
2021-03-16Week 10 Day 1 - Fast Inverse Square Root and Duff's Device
2021-03-16Week 10 Day 1 - Guest Lecture + Animation
2021-03-16Week 9 Day 1 - Algorithms
2021-03-15Week 10 Day 1 - BSTs Part II
2021-03-13Extra Credit Workshop: Sea Shanties


Tags:
csci 41
std
c++
data structures
trees
BSTs
set
map
unordered_map