Lecture 25: Lexicon Case Study

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 [[http://see.stanford.edu/materials/icspacs106b/transcripts/ProgrammingAbstractions-Lecture25.pdf|Programming Abstractions - Lecture 25]]