Lecture 24: Compare Map Implementations
author: Julie Zelenski,
Computer Science Department, Stanford University
published: Nov. 15, 2010, recorded: January 2008, views: 2325
released under terms of: Creative Commons Attribution Non-Commercial (CC-BY-NC)
published: Nov. 15, 2010, recorded: January 2008, views: 2325
released under terms of: Creative Commons Attribution Non-Commercial (CC-BY-NC)
Related content
Report a problem or upload files
If you have found a problem with this lecture or would like to send us extra material, articles, exercises, etc., please use our ticket system to describe your request and upload the data.Enter your e-mail into the 'Cc' field, and we will keep you updated with your request's status.
Description
What are we doing today? We’re gonna talk about hashing. Hashing’s one of the coolest things you’re ever gonna learn in 106b, so it’s a good day to be here and learn something really neat, kinda clever, inventive idea for how you do search and retrieval in a very efficient way. That’s covered in chapter 11 of the text and that actually is the last bit of the text, right, is chapter 11. So what we’re gonna do next week is we’re gonna try to pull some stuff together. ...
See the whole transcript at Programming Abstractions - Lecture 24
Link this page
Would you like to put a link to this lecture on your homepage?Go ahead! Copy the HTML snippet !
Write your own review or comment: