The Last Slog Week 10 (Apr. 9, 2016)
With the end of the 12th week of lecture, we wrapped up our time in csc148 by discussing and implementing hash tables. As seen in our second assignment, abstract data types that use hash tables such as dictionaries are much more efficient when searching for values compared to lists. Rather than searching through an entire list to find a value, hash tables allow you to quickly access it through its key. However, due to the "Birthday Paradox", chaining or probing must be used when hashing values into keys to prevent keys from having the same index. Overall I find hash tables a great way to reduce run time when searching through a list of values.











