This video was recorded at Stanford Engineering Everywhere CS106B - Programming Abstractions. And that's where this operation starts to bog down, given the idea that you might be moving half or more of your items, on average, to make that space for that one to open up. It is going to require a linear time operation to get new words into the data structure. Okay, probably still, though, a reasonable approach, right? These are the operations that get done immense numbers of times in Boggle, right? You're doing a ton of contains (word)'s and contains (prefix)'s as you're exhaustively searching that big board. But the add's are done kinda once at the beginning. ... See the whole transcript at Programming Abstractions - Lecture 25
You are being taken to the material on
another site. This will open a new window.
Rate this Material
You just viewedLecture 25: Lexicon Case Study.
Please take a moment to rate this material.
Know the Author?
Search by ISBN?
It looks like you have entered an ISBN number. Would you like to search using what you have
entered as an ISBN number?
Searching for Members?
You entered an email address. Would you like to search for members? Click Yes to continue. If no, materials will be displayed first. You can refine your search with the options on the left of the results page.